fasta-redux benchmark N=25,000,000
Each chart bar shows how many times more Memory, one ↓ fasta-redux program used, compared to the program that used least Memory.
These are not the only programs that could be written. These are not the only compilers and interpreters. These are not the only programming languages.
Column × shows how many times more each program used compared to the benchmark program that used least.
| sort | sort | sort | ||||
| × | Program Source Code | CPU secs | Elapsed secs | Memory KB | Code B | ≈ CPU Load |
|---|---|---|---|---|---|---|
| 1.0 | Pascal Free Pascal | 8.04 | 8.04 | 8 | 1227 | 0% 0% 100% 0% |
| 46 | ATS #4 | 1.88 | 1.88 | 364 | 2593 | 0% 1% 0% 100% |
| 47 | C gcc #3 | 1.60 | 1.61 | 372 | 1321 | 0% 0% 99% 1% |
| 47 | C gcc #2 | 2.00 | 2.01 | 376 | 1168 | 0% 0% 100% 1% |
| 104 | C++ g++ #2 | 1.70 | 1.71 | 832 | 1474 | 0% 0% 1% 100% |
| 104 | C++ g++ | 2.51 | 2.51 | 832 | 1470 | 0% 1% 100% 0% |
| 159 | Go #3 | 1.96 | 1.97 | 1,272 | 1237 | 1% 0% 1% 100% |
| 159 | Go #2 | 1.96 | 1.97 | 1,272 | 1236 | 0% 100% 0% 1% |
| 188 | Ada 2005 GNAT #2 | 2.03 | 2.03 | 1,500 | 1909 | 0% 0% 1% 100% |
| 364 | Perl | 182.94 | 183.02 | 2,912 | 1112 | 1% 100% 0% 1% |
| 763 | Lisp SBCL #4 | 6.05 | 6.06 | 6,100 | 2005 | 0% 0% 0% 100% |
| 1,906 | C# Mono | 2.80 | 2.81 | 15,244 | 1438 | 1% 2% 98% 0% |
| 1,925 | C# Mono #3 | 2.95 | 2.96 | 15,396 | 1441 | 1% 0% 100% 1% |
| 2,164 | Java 7 #3 | 2.56 | 2.52 | 17,308 | 1443 | 0% 1% 1% 100% |
| 2,192 | F# Mono #2 | 3.04 | 3.04 | 17,532 | 1074 | 0% 1% 100% 1% |
| 4,240 | Scala #2 | 5.00 | 4.70 | 33,916 | 1372 | 5% 1% 100% 2% |
| 6,861 | Clojure #4 | 10.89 | 9.27 | 54,884 | 1503 | 6% 97% 8% 7% |
| "wrong" (different) algorithm / less comparable programs | ||||||
| 64 | Fortran Intel #2 | 3.38 | 3.39 | 508 | 1369 | |
| 134 | C++ g++ #5 | 0.21 | 0.21 | 1,072 | 1753 | |
| 961 | Lisp SBCL #5 | 2.04 | 2.04 | 7,684 | 2343 | |
| 1,037 | Python 3 #6 | 58.08 | 58.10 | 8,296 | 900 | |
| 1,690 | Python 3 #7 | 3.56 | 3.56 | 13,520 | 972 | |
| missing benchmark programs | ||||||
| Dart | No program | |||||
| Erlang | No program | |||||
| Erlang HiPE | No program | |||||
| Fortran Intel | No program | |||||
| Haskell GHC | No program | |||||
| OCaml | No program | |||||
| PHP | No program | |||||
| Python 3 | No program | |||||
| Racket | No program | |||||
| Ruby 2.0 | No program | |||||
| Ruby JRuby | No program | |||||
fasta-redux benchmark : Generate and write random DNA sequences
diff program output N = 1000 with this 10KB output file to check your program is correct before contributing.
We are trying to show the performance of various programming language implementations - so we ask that contributed programs not only give the correct result, but also use the same algorithm to calculate that result.
Each program should
- generate DNA sequences, by copying from a given sequence
- generate DNA sequences, by weighted random selection from 2 alphabets
- convert the expected probability of selecting each nucleotide into cumulative probabilities
- encode the cumulative probabilities as blocks of duplicate lookup-table items
- select an initial lookup-table item using a random number as an approximate index
- match that random number against the cumulative probabilities to select the nucleotide
- use this linear congruential generator to calculate a random number each time a nucleotide needs to be selected (don't cache the random number sequence)
IM = 139968 IA = 3877 IC = 29573 Seed = 42 Random () Seed = (Seed * IA + IC) modulo IM = Seed / IM
- write 3 sequences line-by-line in FASTA format