fork(1) download 
  1. import time
  2.  
  3. n = 1000000
  4. times = 10
  5.  
  6. start = time.time()
  7.  
  8.  
  9. for t in range(times):
  10.     F = [False] * n
  11.     prime = [True] * n
  12.     prime[0] = prime[1] = False
  13.  
  14.     prime[4::2] = F[4::2]
  15.     for i in range(3, int(n**0.5+1), 2):
  16.         if prime[i]:
  17.             prime[i*i:n:2*i] = F[i*i:n:2*i]
  18.  
  19. print((time.time() - start) / times)
  20.  
  21. print(sum(prime))
  22. # 78498
Success #stdin #stdout 0.56s 35284KB
comments (?)
stdin 
Standard input is empty
stdout 
0.04890239238739014
78498
https://ideone.com/ZqfBEf
language:
Python 3 (python  3.9.5)
created:
6 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!