Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Prime Numbers :-> Sieve of Eratosthenes
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
#python 3.5.2 from time import time start = time() N = 999999 prime = [True for i in range(N+1)] p = 2 while (p * p <= N): if(prime[p] == True): for i in range(p*p,N+1,p): prime[i] = False p+=1 end = time() print("Total Time : ", end-start) for i in range(2,N+1): if(prime[i] == True): #print(i,end = " ") pass
[
+
]
Show input
Absolute running time: 0.68 sec, cpu time: 0.98 sec, memory peak: 14 Mb, absolute service time: 0,69 sec
edit mode
|
history
|
discussion
Total Time : 0.3981955051422119