fannkuch-redux benchmark N=12

Each chart bar shows how many times more Memory, one ↓ fannkuch-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.

    sortsort sort
  ×   Program Source Code CPU secs Elapsed secs Memory KB Code B ≈ CPU Load
1.0Fortran Intel 57.5957.61516590  1% 0% 1% 100%
1.4OCaml 97.7297.74708524  1% 0% 100% 0%
1.4C++ g++ #3 68.3068.32720593  0% 0% 100% 1%
1.4C++ g++ #7 22.6122.627321150  100% 1% 0% 0%
1.5C gcc #4 22.6422.657521183  100% 0% 1% 1%
1.5Pascal Free Pascal 87.2821.877521018  100% 100% 100% 100%
1.6C gcc #3 54.3454.36800567  0% 0% 1% 100%
1.6C gcc 88.3088.32816508  0% 0% 100% 1%
1.7C gcc #2 54.4913.948801557  95% 99% 99% 99%
2.0Go 65.2916.461,024900  100% 99% 99% 99%
2.9C gcc #5 35.659.101,516910  99% 96% 97% 100%
3.5C++ g++ #4 51.9113.281,7841439  94% 99% 100% 98%
3.5C++ g++ #5 52.8413.511,8041440  100% 99% 93% 100%
3.6Perl 42 min42 min1,872457  5% 18% 0% 78%
5.3OCaml #2 85.9485.962,740473  1% 0% 0% 100%
6.4PHP #2 43 min43 min3,304441  1% 38% 0% 62%
6.5PHP 53 min53 min3,344482  1% 0% 0% 100%
7.2C++ g++ 59.5515.213,6961059  100% 94% 98% 100%
7.9Ada 2005 GNAT #3 44.8311.274,1002100  100% 100% 99% 100%
11Python 3 #6 39 min39 min5,432385  95% 0% 0% 6%
12Haskell GHC #4 76.6870.906,288658  86% 17% 3% 3%
14Ruby 41 min41 min7,260384  91% 9% 0% 2%
15Haskell GHC #2 8 min165.247,740808  81% 81% 80% 81%
16Haskell GHC #5 68.2317.368,080834  100% 99% 99% 96%
16Rust #2 57.5714.708,1281191  98% 100% 99% 94%
17Haskell GHC 12 min9 min8,636553  39% 43% 26% 35%
20Fortran Intel #3 55.7413.9810,5361148  100% 100% 100% 100%
21Perl #2 38 min9 min10,976565  100% 99% 100% 99%
24OCaml #4 0.0116.4912,1601004  100% 100% 100% 100%
27Erlang 13 min201.1413,6921038  99% 97% 99% 98%
29PHP #3 44 min11 min15,1881150  100% 100% 100% 100%
30Erlang HiPE 8 min124.5915,7321038  99% 99% 94% 100%
39Racket #2 278.63278.6220,164903  1% 22% 39% 41%
40Racket 5 min5 min20,504649  1% 0% 0% 100%
43OCaml #3 0.0116.2522,3081017  100% 100% 100% 100%
46Lisp SBCL #3 74.0974.1123,696821  1% 100% 0% 0%
52Racket #3 5 min85.9626,5761096  86% 84% 86% 99%
55Ruby #2 51 min13 min28,5321426  97% 97% 98% 98%
62Lisp SBCL #4 64.9416.7332,1481518  99% 100% 98% 92%
64Lisp SBCL #5 59.3559.3732,868674  1% 1% 0% 100%
64Java  68.6417.4133,0321282  98% 98% 99% 99%
71Scala #2 59.6215.2336,8201017  99% 98% 98% 97%
75Dart #2 84.1983.6038,680495  1% 22% 78% 1%
75F# Mono #4 63.6163.6238,748612  100% 1% 1% 0%
76C# Mono 70.3570.3739,380520  100% 1% 0% 0%
77C# Mono #2 46.6046.6139,548564  0% 1% 100% 1%
78Python 3 #4 33 min8 min39,992944  99% 97% 100% 97%
83C# Mono #3 96.1224.5242,9281096  98% 98% 98% 99%
84F# Mono #2 97.0597.0743,192548  0% 0% 100% 1%
84Java  #2 70.7670.7243,452514  1% 1% 0% 99%
91Scala 92.2492.2147,188459  1% 100% 1% 1%
96F# Mono 159.02159.2349,744551  1% 1% 85% 16%
99F# Mono #3 83.5322.5451,160945  88% 96% 91% 96%
144Clojure #3 76.7420.0574,4761491  96% 99% 94% 94%
158Lisp SBCL #2 190.77191.0481,520513  1% 1% 0% 100%
177Clojure #2 187.9160.8191,2761252  79% 78% 76% 75%
202Hack #2 44 min44 min104,412440  43% 11% 6% 42%
222Hack 20 min20 min114,620532  0% 84% 16% 2%
1,309Ruby JRuby 10 min10 min675,384384  11% 30% 47% 15%
1,326Ruby JRuby #2 21 min5 min684,4681426  90% 92% 99% 82%
Haskell GHC #3 Timed Out1h 00 min1153
Hack #3 Failed1150
"wrong" (different) algorithm / less comparable programs
1.5C++ g++ #6 37.7637.77752894
65Java  #3 41.5010.5633,4081633
77C# Mono #4 38.4838.5039,552710
77Python 3 #3 1940.66490.6039,868773
82C# Mono #5 42.6011.0042,1641400
85Lisp SBCL 53.4513.5443,6281607

 fannkuch-redux benchmark : Indexed-access to tiny integer-sequence

You can write your own program for this task and contribute to the benchmarks game by following these general instructions.

More specifically:

diff program output N = 7 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.

For N = 7 programs should generate these permutations (40KB) - which, incidentally, seem to be in the same order as permutations generated by the Tompkins-Paige algorithm, see pages 150-151 Permutation Generation Methods Robert Sedgewick.

The fannkuch benchmark is defined by programs in Performing Lisp Analysis of the FANNKUCH Benchmark, Kenneth R. Anderson and Duane Rettig.

Each program should

The conjecture is that this maximum count is approximated by n*log(n) when n goes to infinity.

FANNKUCH is an abbreviation for the German word Pfannkuchen, or pancakes, in analogy to flipping pancakes.


Thanks to Oleg Mazurov for insisting on a checksum and providing this helpful description of the approach he took -

Revised BSD license

  Home   Conclusions   License   Play