fork download 
  1. limit=pow(10,6)
  2.  
  3. f=[True]*(limit)
  4. for i in range(2,int(limit**0.5)+1):
  5. 	if not f[i]: continue
  6. 	for j in range(i*i,limit,i):
  7. 		if f[j]: f[j]=False
  8.  
  9. primes=[2,3]
  10. for i in range(5,limit,2):
  11. 	if f[i]:
  12. 		primes.append(i)
  13.  
  14. print("number of primes:",len(primes))
  15. print("0-100:",primes[:25]) # check 1-100
  16. print("5 last primes",primes[-5:])
  17.  
Success #stdin #stdout 0.69s 8776KB
comments ()
stdin 
Standard input is empty
stdout 
number of primes: 78498
0-100: [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
5 last primes [999953, 999959, 999961, 999979, 999983]
https://ideone.com/1PGxZs
primes sieve
language:
Python 3 (python  3.12)
created:
9 years ago
visibility:
secret

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!