Quote Originally Posted by Alpha View Post
oh, i already got my seive code working....

but im not letting him have at that. a 2^31 -1 run uses about 256mb of ram and i can find all the primes upto that point in about 30 seconds on my T7500 with 2 threads.

its soooo much faster than the brute force method

oh, i just checked my 32m time - .329 seconds
Nice, my code is quite slow.

I need to find a way that once the first thread is done (which is sooner than all the other threads), to create another thread and do more work.