Question

Fastest of Fastest Algorithm to calculate 10000 primes in python ?is it

Answer 1

import time
from math import sqrt
st=time.time()
mdu=0
check =3
noofprime=2
primeLs=[2,3]
prime=True
while noofprime!=10000:
check=check+2
if check%3==0:check=check+2
sqrcheck=int (sqrt(check))+1

for div in range (3,sqrcheck):
prime=True
mdu=check%div
if mdu==0 :
prime=False
break

if prime==True:
noofprime= noofprime+1
primeLs=primeLs+[check]

et=time.time()
print primeLs[noofprime-1]
print st
print et
print (et-st)/60

Answer 2

i get this time when checked without writing to list
prime 104729
st:1298174950.11
et:1298174952.94
0.0471333344777