So I tried I tried calculating millions and millions of different combinations of the below string but I was only calculating roughly 1,750 combinations a second which isn\'
Are you sure you're only getting 1750 combinations per second? I'm getting about 10 million.
def test(n):
start = time.time()
count = 0
for chars in product("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ12234567890!@#$%^&*?,()-=+[]/;", repeat = 4):
count += 1
if count == n: break
return time.time() - start
>>> test(10000)
0.03300023078918457
>>> test(1000000)
0.15799999237060547
>>> test(10000000)
1.0469999313354492
I don't think my computer is that much faster than yours.
note: I posted this as an answer because I wanted to show code. It's really more of a comment. So please, no upvotes or downvotes.