fannkuch-redux benchmark N=12

Each chart bar shows how many times slower, one ↓ fannkuch-redux program was, compared to the fastest program.

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.

     sortsortsort
  ×   Program Source Code CPU secs Elapsed secs Memory KB Code B ≈ CPU Load
1.0OCaml #3 0.0026.4218,6961017  100% 100% 100% 100%
1.0OCaml #4 0.0033.579,2681004  100% 100% 100% 100%
6,816C gcc #4 27.2627.273161183  0% 0% 1% 100%
6,818C++ g++ #7 27.2727.282841150  0% 100% 0% 1%
9,565C gcc #5 38.269.75340910  100% 99% 99% 95%
9,823Ada 2005 GNAT #3 39.299.871,6562100  100% 100% 100% 100%
11,994C gcc #3 47.9847.99316567  0% 100% 1% 1%
12,149Rust #2 48.6012.416,9161180  100% 98% 100% 94%
12,508C++ g++ #5 50.0312.881,0361440  99% 99% 100% 99%
13,119C++ g++ #4 52.4813.371,0361439  100% 100% 99% 95%
13,693C gcc #2 54.7714.243441557  91% 98% 100% 96%
14,470C gcc 57.8857.90316508  0% 100% 1% 1%
14,478C++ g++ #3 57.9157.93284593  1% 0% 0% 100%
14,744Lisp SBCL #5 58.9858.9922,576674  1% 1% 100% 1%
15,006Rust 60.0215.0437,656644  100% 100% 100% 100%
15,091Scala #2 60.3615.4223,1041017  98% 97% 98% 98%
15,900Lisp SBCL #4 63.6016.3226,1881518  100% 99% 98% 93%
16,095Java  64.3816.3319,9081282  98% 100% 98% 99%
16,113Haskell GHC #3 64.4516.433,4521153  100% 100% 99% 94%
16,122C# Mono #2 64.4964.5118,616564  1% 0% 100% 0%
16,722Fortran Intel #3 66.8916.858,5081148  100% 100% 100% 100%
16,884Pascal Free Pascal 67.5416.936961018  100% 100% 100% 100%
17,102Fortran Intel 68.4168.43520590  100% 0% 0% 0%
17,775OCaml #2 71.1071.12596473  0% 0% 0% 100%
17,849Lisp SBCL #3 71.4071.4117,736821  1% 0% 0% 100%
18,021F# Mono #4 72.0872.1119,124612  0% 1% 100% 1%
18,840Java  #2 75.3675.3220,052514  1% 1% 100% 0%
19,142Haskell GHC #5 76.5719.383,720834  100% 96% 100% 99%
19,460Dart #2 77.8477.3414,720495  4% 9% 100% 4%
21,864Haskell GHC #4 87.4684.031,932658  100% 2% 2% 2%
22,204C# Mono 88.8288.8418,624520  0% 100% 1% 0%
24,999Scala 100.0099.9422,296459  1% 99% 0% 1%
25,543F# Mono #2 102.17102.2020,968548  0% 100% 0% 1%
25,795Go 103.1825.97760900  99% 99% 100% 100%
28,744C# Mono #3 114.9829.2819,7881096  99% 99% 98% 98%
31,261F# Mono #3 125.0432.7623,212945  93% 98% 95% 97%
35,162OCaml 140.65140.69592524  0% 0% 0% 100%
36,148Clojure #3 144.5937.0253,3361491  97% 98% 99% 97%
42,073F# Mono 168.29168.2423,536551  1% 51% 50% 1%
45,643Lisp SBCL #2 182.57182.6943,728513  0% 1% 1% 100%
64,700Clojure #2 258.8076.9156,9041088  85% 85% 83% 83%
76,043Racket #2 5 min5 min16,876903  0% 0% 30% 70%
78,446Racket 5 min5 min15,364649  0% 1% 41% 60%
83,164Racket #3 5 min83.7717,1601096  99% 100% 99% 100%
101,381Erlang HiPE 6 min102.5312,9441038  100% 98% 98% 100%
112,578Haskell GHC #2 7 min144.594,996808  79% 78% 78% 78%
144,650Haskell GHC 9 min7 min3,768553  71% 7% 7% 38%
178,904Ruby JRuby 11 min11 min652,704384  29% 18% 33% 23%
540,633Ruby JRuby #2 36 min10 min644,8801426  77% 92% 100% 86%
622,251Perl #2 41 min10 min6,292565  100% 100% 99% 100%
655,993Python 3 #6 43 min43 min4,200385  0% 0% 1% 100%
678,895PHP #2 45 min45 min2,544441  0% 0% 0% 100%
705,079Perl 47 min47 min1,752457  100% 0% 0% 0%
711,794PHP #3 47 min12 min10,5641150  91% 93% 99% 100%
826,890Ruby 55 min55 min5,340384  41% 5% 1% 55%
865,861PHP 57 min57 min2,576482  0% 98% 3% 0%
1,000,014Python 3 #2 1h 06 min16 min27,840797  99% 99% 98% 100%
1,097,826Python 3 1h 13 min18 min27,8881108  100% 99% 99% 98%
1,244,776Ruby #2 1h 22 min21 min19,9161426  93% 98% 100% 98%
C++ g++ Failed1059
"wrong" (different) algorithm / less comparable programs
9,126C++ g++ #6 36.5036.52284894
11,573Java  #3 46.2911.7622,5801633
13,330Lisp SBCL 53.3213.4833,3401607
21,539C# Mono #4 86.1686.1718,884710
28,395C# Mono #5 113.5828.8921,0721400

 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