reverse-complement benchmark ≈240MB N=25,000,000
Each chart bar shows how many times more Memory, one ↓ reverse-complement 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 | OCaml #3 | 0.90 | 12,600 | 1314 | 62% 51% 67% 78% | |
| 2.0 | OCaml | 2.06 | 25,432 | 1064 | 26% 12% 55% 69% | |
| 9.7 | Pascal Free Pascal #2 | 2.17 | 2.17 | 122,544 | 751 | 0% 0% 0% 100% |
| 9.7 | ATS #2 | 1.08 | 1.08 | 122,596 | 1895 | 3% 1% 5% 99% |
| 9.8 | Ada 2005 GNAT | 4.12 | 4.13 | 123,524 | 885 | 64% 0% 0% 37% |
| 10 | C++ g++ #3 | 1.34 | 1.35 | 124,956 | 810 | 0% 0% 2% 100% |
| 10 | C gcc #4 | 1.34 | 1.34 | 125,096 | 704 | 1% 0% 1% 100% |
| 10 | Haskell GHC #3 | 1.90 | 1.73 | 125,816 | 999 | 42% 5% 5% 63% |
| 10 | Ruby 2.0 #2 | 10.16 | 10.17 | 127,452 | 255 | 0% 0% 1% 100% |
| 10 | OCaml #4 | 1.65 | 1.66 | 127,564 | 2064 | 1% 0% 100% 1% |
| 12 | C++ g++ #5 | 27.78 | 27.79 | 151,940 | 646 | 85% 0% 0% 16% |
| 13 | Go #3 | 1.86 | 1.87 | 159,972 | 543 | 5% 99% 1% 6% |
| 13 | Go #2 | 2.20 | 2.20 | 160,232 | 546 | 1% 99% 1% 0% |
| 13 | Lisp SBCL | 4.78 | 4.79 | 164,812 | 896 | 0% 98% 2% 0% |
| 13 | Fortran Intel #2 | 8.28 | 8.30 | 167,656 | 772 | 0% 0% 0% 100% |
| 14 | C# Mono | 2.52 | 2.52 | 170,864 | 1099 | 0% 1% 15% 87% |
| 14 | OCaml #2 | 4.50 | 4.51 | 171,956 | 394 | 0% 0% 0% 100% |
| 14 | Racket #2 | 4.52 | 4.53 | 174,132 | 1026 | 0% 0% 100% 0% |
| 16 | Ada 2005 GNAT #2 | 1.63 | 1.24 | 197,324 | 3220 | 41% 1% 90% 2% |
| 19 | C++ g++ #2 | 1.33 | 1.34 | 244,808 | 1082 | 2% 0% 0% 100% |
| 19 | C++ g++ | 4.04 | 4.04 | 245,208 | 571 | 1% 0% 0% 100% |
| 19 | C++ g++ #4 | 1.22 | 0.84 | 245,428 | 2275 | 19% 31% 12% 88% |
| 20 | Fortran Intel | 1.02 | 1.04 | 246,460 | 1013 | 1% 0% 1% 100% |
| 20 | C gcc #2 | 0.92 | 0.65 | 248,632 | 741 | 17% 31% 83% 16% |
| 20 | Go | 2.36 | 2.09 | 249,420 | 1243 | 1% 6% 12% 99% |
| 20 | C# Mono #3 | 6.12 | 6.13 | 253,540 | 863 | 0% 100% 0% 1% |
| 21 | Java 7 #7 | 2.39 | 8.78 | 263,532 | 1640 | 20% 58% 45% 23% |
| 23 | Java 7 #3 | 2.93 | 1.52 | 294,784 | 1661 | 32% 59% 58% 47% |
| 29 | PHP | 7.74 | 7.75 | 369,020 | 297 | 0% 1% 100% 0% |
| 30 | Perl #3 | 3.04 | 3.05 | 374,472 | 284 | 0% 1% 1% 100% |
| 32 | Scala #4 | 2.32 | 2.29 | 405,904 | 501 | 5% 2% 0% 98% |
| 38 | Java 7 #4 | 3.07 | 2.99 | 476,240 | 592 | 3% 2% 2% 99% |
| 38 | Clojure | 14.95 | 7.72 | 482,228 | 1044 | 32% 81% 40% 43% |
| 39 | Scala #8 | 2.19 | 1.70 | 489,548 | 761 | 3% 4% 95% 31% |
| 39 | C gcc | 1.16 | 0.85 | 496,940 | 1867 | 25% 0% 89% 26% |
| 40 | Racket | 13.39 | 13.39 | 506,524 | 547 | 0% 0% 0% 100% |
| 41 | Java 7 #6 | 1.92 | 1.68 | 511,484 | 745 | 2% 26% 85% 5% |
| 41 | Clojure #4 | 16.00 | 8.67 | 522,784 | 997 | 27% 34% 87% 39% |
| 48 | Python 3 #4 | 6.52 | 6.54 | 601,488 | 325 | 0% 0% 100% 0% |
| 49 | Haskell GHC #2 | 3.44 | 2.95 | 618,168 | 912 | 6% 6% 100% 5% |
| 55 | Erlang HiPE #4 | 45.05 | 36.66 | 689,368 | 1167 | 77% 22% 9% 17% |
| 56 | Scala #7 | 5.12 | 2.86 | 703,028 | 949 | 25% 44% 67% 47% |
| 61 | Erlang HiPE | 21.66 | 11.71 | 762,600 | 1302 | 80% 40% 26% 40% |
| 73 | Python 3 #3 | 28.73 | 28.78 | 924,620 | 295 | 90% 10% 0% 1% |
| 81 | Ruby JRuby #2 | 24.20 | 19.28 | 1,026,664 | 255 | 3% 100% 12% 11% |
| 82 | Erlang HiPE #3 | 61.05 | 58.75 | 1,030,104 | 624 | 4% 0% 1% 99% |
| 85 | Dart #2 | 51.73 | 51.69 | 1,075,468 | 555 | 99% 0% 0% 1% |
| Dart | Failed | 443 | ||||
| Scala #6 | Failed | 519 | ||||
| Scala #5 | Failed | 329 | ||||
| "wrong" (different) algorithm / less comparable programs | ||||||
| 39 | Python 3 #5 | 5.15 | 5.16 | 485,916 | 306 | |
| 41 | Java 7 | 1.83 | 1.83 | 511,096 | 476 | |
| 50 | Clojure #3 | 15.90 | 8.75 | 635,832 | 812 | |
| missing benchmark programs | ||||||
| F# Mono | No program | |||||
reverse-complement benchmark : Read DNA sequences - write their reverse-complement
diff program output for this 10KB input file (generated with the fasta program N = 1000) with this 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.
We use the FASTA file generated by the fasta benchmark as input for this benchmark. Note: the file may include both lowercase and uppercase codes.
Each program should
- read line-by-line a redirected FASTA format file from stdin
- for each sequence:
- write the id, description, and the reverse-complement sequence in FASTA format to stdout
We use these code complements:
code meaning complement A A T C C G G G C T/U T A M A or C K R A or G Y W A or T W S C or G S Y C or T R K G or T M V A or C or G B H A or C or T D D A or G or T H B C or G or T V N G or A or T or C N
"by knowing the sequence of bases of one strand of DNA we immediately know the sequence of the DNA strand which will bind to it, this strand is called the reverse complement"
DNA: Structure and Function