This program was coded with two things in mind: visual representation and representation of speed. It was coded in C using every trick I could think of to shrink the footprint of the algorithm to a minimum. So, it should be nearly as fast as a BFPC can possibly be (without changing what characters to check for based on your input.) Running this program on my computer gave about 100,000,000 attempts per second in fast mode.
There are three modes:
//Graphic mode// prints out the password attempts as it works so you can see exactly what the BFPC method looks like.
//Fast mode// prints out only the number of attempts tried in large numbers, as well as the current attempt string.
//Fastest mode// prints out nothing during execution, doesn't keep track of the number of attempts, and only prints out clock cycles at the end. It's not much to look at while working, but you can see what a repl-based BFPC is truly capable of.