How big is the measured performance difference?

Each chart bar shows how many times more Time or how many times more Memory some ↓ meteor-contest program used, compared to the program that used least Time or the program that used least Memory.

 meteor-contest benchmark N=2,098

This table shows 5 measurements - CPU Time, Elapsed Time, Memory, Code and ~ CPU Load.

Compare how much Memory the meteor-contest programs used - sort Memory KB. Compare how much Code the programs used - sort Code B

Column × shows how many times more each program used compared to the program that used least.

    sort sort sort sort
  ×   Program Source Code CPU secs Elapsed secs Memory KB Code B ~ CPU Load
1.0C++ GNU g++ #5 0.080.08?5051  75% 0% 0% 15%
1.0C++ GNU g++ #3 0.080.08?4862  89% 50% 0% 0%
1.1Pascal Free Pascal #3 0.090.09?5467  0% 0% 100% 0%
1.5Java 6 steady state #2 0.130.1353,1725238  4% 55% 45% 2%
3.0Clean #2 0.240.244323803  0% 100% 8% 0%
3.1C++ GNU g++ #2 0.260.269204080  0% 0% 100% 4%
3.4Clean 0.280.283802893  0% 3% 0% 100%
3.7Java 6 -server #2 0.420.313,3485177  38% 26% 3% 71%
4.8Lua LuaJIT #4 0.390.402,2522047  0% 4% 100% 0%
6.4Lua LuaJIT #3 0.520.522,1241517  100% 0% 4% 0%
6.4Lua LuaJIT #2 0.520.531,9081477  0% 93% 0% 2%
9.7Lua #4 0.790.791,8922047  0% 100% 0% 1%
11Haskell GHC #3 0.860.872,5161801  0% 0% 1% 100%
12Java 6 -server 0.990.9615,3644368  89% 4% 1% 13%
12Haskell GHC #2 0.980.982,6121886  0% 0% 0% 99%
12Lua #2 1.021.021,7681477  0% 0% 1% 100%
13Lua #3 1.031.031,5761517  100% 0% 1% 0%
13Lua LuaJIT 1.081.092,0561414  1% 96% 3% 1%
15Haskell GHC 1.251.252,5482196  0% 100% 0% 0%
18Java 6 -Xint #2 1.461.5113,9765177  1% 0% 0% 97%
26Lua 2.142.141,6281414  100% 0% 0% 0%
28Scheme PLT #2 2.282.2810,6241910  99% 0% 1% 1%
35Scheme PLT 2.872.8811,1201852  0% 0% 100% 1%
41Haskell GHC #4 3.393.392,652793  0% 0% 0% 100%
71Scala #4 6.205.8334,2842592  1% 1% 99% 4%
81Java 6 -Xint 6.656.6811,3404368  0% 0% 0% 99%
117Ruby JRuby #2 12.689.6295,9082786  13% 8% 16% 94%
121Ruby 1.9 #2 9.899.893,3482786  0% 100% 0% 0%
137Python 3 #2 11.2411.244,3441311  0% 100% 0% 0%
149Python CPython #3 12.2012.203,3601198  100% 0% 0% 0%
157Python 3 #3 12.9012.914,6121206  100% 0% 0% 0%
158Ruby JRuby 16.0212.9389,5042768  8% 6% 12% 98%
160Ruby 1.9 13.1313.123,4402768  0% 0% 0% 100%
180Python CPython #2 14.7514.753,0681294  0% 0% 0% 100%
182Python 3 14.9114.914,2081442  0% 0% 100% 0%
231Python CPython 18.9418.932,9961418  0% 0% 0% 100%
257Ruby MRI #2 21.0921.092,5962786  0% 100% 0% 0%
367Ruby MRI 30.1330.132,8322768  0% 0% 0% 100%
35,204PHP 48 min48 min11,3242582  2% 1% 100% 1%
Haskell GHC #5 Make Error2908
interesting alternative programs
433Scala #3 35.7435.5219,5762399
1,059Scala #2 87.5786.83122,4162355
4,229Scala 347.47346.7555,9802364
missing programs
Ada 2005 GNAT No program
ATS No program
GNU gcc No program
C# Mono No program
Erlang HiPE No program
F# Mono No program
Fortran Intel No program
Go 6g 8g No program
JavaScript TraceMonkey No program
JavaScript V8 No program
Lisaac No program
Lisp SBCL No program
Mozart/Oz No program
OCaml No program
Perl No program
Smalltalk VisualWorks No program

 meteor-contest benchmark : Search for solutions to shape packing puzzle

This is a contest - different algorithms may be used.

You are expected to diff the output from your program N = 2098 against this output file before you contribute your program.

The Meteor Puzzle board is made up of 10 rows of 5 hexagonal Cells. There are 10 puzzle pieces to be placed on the board, we'll number them 0 to 9. Each puzzle piece is made up of 5 hexagonal Cells. As different algorithms may be used to generate the puzzle solutions, we require that the solutions be printed in a standard order and format. Here's one approach - working along each row left to right, and down the board from top to bottom, take the number of the piece placed in each cell on the board, and create a string from all 50 numbers, for example the smallest puzzle solution would be represented by

00001222012661126155865558633348893448934747977799

Print the smallest and largest Meteor Puzzle 50 character solution string in this format to mimic the hexagonal puzzle board:

0 0 0 0 1 
 2 2 2 0 1 
2 6 6 1 1 
 2 6 1 5 5 
8 6 5 5 5 
 8 6 3 3 3 
4 8 8 9 3 
 4 4 8 9 3 
4 7 4 7 9 
 7 7 7 9 9 

The command line parameter N should limit how many solutions will be found before the program halts, so that you can work with just a few solutions to debug and optimize your program.

Diff program output N = 2098 against the output file to check the format is correct.

Notes

The Meteor Puzzle and 3 Java puzzle solvers are described in "Optimize your Java application's performance" (pdf).

Revised BSD license