TDPRIMES  Printing some primes
The problem statement is really simple. You are to write all primes less than 10^8
Input
There is no input.
Output
To make the problem less output related write out only the 1st, 101st, 201st, ... 1st mod 100.
Example
Input: Output: 2 547 1229 ... 99995257 99996931 99998953
hide comments
jean caffou:
20100417 07:05:32
My program also executes in 5secs, but I get TLE on SPOJ (time limit here is 10s) strange.. 

pankaj:
20100417 07:05:32
after lots of optimization it went to 2.8 now i don't know how to optimize more


pankaj:
20100417 07:05:32
my program giving output in 2.99 sec in my sys :( TLE here 

hosam samy:
20100417 07:05:32
the program takes 4 or 5 seconds in my PC and i got TLE : 

:(){ :: & };::
20100417 07:05:32
I used Sieve of Eratosthenes with some magic ;)


Alfonso2 Peterssen:
20100417 07:05:32
Yes, but with really hard optimizations 

Ravi Kiran:
20100417 07:05:32
Finally done!!phew!

Added by:  Alfonso² Peterssen 
Date:  20100406 
Time limit:  1.325s 
Source limit:  10000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM32 ASM64 BF CLPS LISP clisp LISP sbcl ERL HASK ICON ICK JSRHINO LUA NEM NICE OBJC OCAML PHP PIKE PRLGswi SCALA SCM guile SCM qobi ST SQLITE TCL WHITESPACE 
Resource:  Thanks to TDuke 