sort:
date
▴
| O6oHmZ | Haskell | Success | 10 years ago | |
| WGGaoo | primesSA from Haskell wiki | Haskell | Success | 10 years ago |
| UVviWF | primesTMWE -- telescopic vs two-stage, [Int] vs [Integer] | Haskell | Success | 12 years ago |
| se0bsB | multistage telescoping production -- primesTME | Haskell | Success | 12 years ago |
| n3XzZY | primesTMWE | Haskell | Success | 11 years ago |
| RzqLP | LimAOE Arr-odds 2012 | Haskell | Success | 8 years ago |
| dE0iU | contiguous accumulating array sieve of E. 2012-10-02 | Haskell | Success | 9 years ago |
| P0E81 | www.haskell.org/haskellwiki/Prime_numbers gist.github.com/WillNess/7672824#file-p0e81-2013-09-08-hs gist.github.com/WillNess/7672836#file-p0e81-2013-10-06-hs | Haskell | Success | 11 years ago |
| H8Y5V | testing the ONeillPrimes*.hs files by Melissa O'Neill from her http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip | Haskell | Success | 14 years ago |
| Ojq01 | Haskell | Success | 11 years ago | |
| xsocD | Haskell | Success | 14 years ago | |
| HO2Hy | Haskell | Success | 14 years ago | |
| FaPOB | C sieve of Eratosthenes, on odds, non-segmented, up to 75M primes / 1,505,776,939 in value in 5.67s ; 100.5M primes / up to 2.05B : 7.96s ~n^1.16, 2018-02-25 | C++ | Success | 3 years ago |
| KwZNc | primes/STUArray from Haskell wiki. j24jxV is faster - fromM_ loops re-written as explicit recursion, unsafe read/write. | Haskell | Success | 7 years ago |
| YDoNq | Haskell | Success | 14 years ago | |
| pfREP | Haskell | Success | 13 years ago | |
| usu1s | Haskell | Success | 15 years ago | |
| eRP1x | Haskell | Success | 14 years ago | |
| zlqrk | Haskell | Success | 15 years ago | |
| mnaXd | Haskell | Success | 15 years ago | |
| MihEN | Haskell | Success | 15 years ago | |
| FU52u | Haskell | Success | 13 years ago |
