[maxrussell]

Originally Posted by ephemera

Ok, here's a small project you can try:

See if you can create a program to enumerate/print all the prime numbers upto 2^32 (~4 billion) as fast as possible.

Sounds too simple? ... try it for yourself and give it your best shot.

After you have written a program compare its performance with other peoples program on the www: http://primes.utm.edu/links/programs...C_source_code/
http://wwwhomes.uni-bielefeld.de/achim/prime_sieve.html

That'll be more of a long term task I feel - intially I want to read/dissect other code.