Sieve originates from one of the numerous "challenges" that I've been participating in
since I don't know when...! The goal of the challenge was to write the fastest program to
compute all prime numbers between 0 and 1,000,000. Anyway this is the fastest of the 5
prime programs in this little contest. On an AMD-K6 315 MHz it takes 0.05 secs to complete.
Below is listed the results together with a speed index:
| Rolf W. Olsen | Yet another ruling... | |
| Sune Fischer | Sorry, but there's only room for ONE in the fast lane! | |
| Krell (Flemming J. Petersen) | Nope, assembler won't do it..! | |
| Fætter 10 (Kenn'th Rasmussen) | What went wrong? | |
| Seņor Gundersen | A fine example of a wasted DatF course + 1 1/2 wasted years at Niels Brock! |
Right-click
here to download the program.