1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 | def sieve(n): m = (n-1) // 2 b = [True]*m i,p,ps = 0,3,[2] while p*p < n: if b[i]: ps.append(p) j = 2*i*i + 6*i + 3 while j < m: b[j] = False j = j + 2*i + 3 i+=1; p+=2 while i < m: if b[i]: ps.append(p) i+=1; p+=2 return ps print len(sieve(1000000)) # 78498 |
-
upload with new input
-
result: Success time: 0.37s memory: 9032 kB returned value: 0
10
78498
-
result: Success time: 0.32s memory: 8200 kB returned value: 0
86028157
78498
-
result: Success time: 0.37s memory: 9048 kB returned value: 0
5000000
78498
-
result: Success time: 0.31s memory: 8200 kB returned value: 0
10
78498
-
result: Success time: 0.38s memory: 9048 kB returned value: 0
5000000000000
78498
-
result: Success time: 0.43s memory: 11248 kB returned value: 0
-
result: Success time: 0.43s memory: 11248 kB returned value: 0
-
result: Success time: 0.61s memory: 6732 kB returned value: 0
78498


