Prob 0007 ‐ 10001st Prime - maccergit/Euler GitHub Wiki

Pretty straightforward problem - leading to direct comparisons between homemade sieve, SymPy, and pyprimesieve implementations.

01

Even a homemade sieve implementation is fast enough for this :

02

However, SymPy makes this easy, and is faster :

03

Finally, pyprimesieve is also easy, and is the fastest :