meteor-contest benchmark N=2,098
Each chart bar shows how many times slower, one ↓ meteor-contest 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.
| sort | sort | sort | ||||
| × | Program Source Code | CPU secs | Elapsed secs | Memory KB | Code B | ≈ CPU Load |
|---|---|---|---|---|---|---|
| 1.0 | PyPy 3 #2 | 0.64 | 0.65 | 74,028 | 1443 | 3% 2% 100% 2% 0% 6% 2% 3% |
| 1.0 | PyPy 3 | 0.67 | 0.67 | 73,588 | 1540 | 0% 0% 1% 100% 3% 2% 0% 0% |
| 1.0 | PyPy 2 #2 | 0.67 | 0.67 | 80,972 | 1485 | 4% 0% 1% 99% 0% 4% 0% 0% |
| 1.0 | PyPy 2 | 0.67 | 0.68 | 81,248 | 1579 | 100% 1% 0% 0% 0% 3% 0% 0% |
| 1.9 | Pyston #2 | 1.23 | 1.23 | 8,868 | 1485 | 2% 2% 1% 0% 2% 1% 0% 100% |
| 2.1 | Nuitka #2 | 1.35 | 1.35 | 11,392 | 1443 | 1% 0% 0% 0% 1% 100% 0% 0% |
| 2.3 | Pyston | 1.49 | 1.49 | 8,364 | 1579 | 4% 2% 0% 100% 1% 1% 0% 1% |
| 2.4 | PyPy 2 #3 | 1.52 | 1.52 | 79,172 | 1354 | 100% 0% 1% 0% 1% 0% 3% 1% |
| 2.4 | PyPy 3 #3 | 1.55 | 1.55 | 71,916 | 1334 | 100% 0% 0% 1% 1% 1% 0% 2% |
| 2.4 | Python development version #2 | 1.55 | 1.55 | 9,512 | 1443 | 0% 0% 0% 100% 1% 1% 1% 0% |
| 2.6 | Python 3 #2 | 1.70 | 1.70 | 10,964 | 1443 | 1% 1% 1% 0% 0% 0% 0% 99% |
| 2.7 | Nuitka | 1.73 | 1.74 | 11,264 | 1540 | 100% 1% 0% 0% 1% 0% 0% 1% |
| 2.8 | Graal | 5.67 | 1.83 | 873,808 | 1540 | 11% 74% 44% 18% 51% 13% 20% 86% |
| 2.9 | Graal #2 | 5.77 | 1.84 | 899,724 | 1443 | 57% 18% 11% 77% 14% 70% 3% 67% |
| 3.2 | Python development version | 2.05 | 2.05 | 9,360 | 1540 | 0% 100% 1% 0% 1% 1% 0% 0% |
| 3.3 | Python 2 #2 | 2.14 | 2.14 | 6,828 | 1485 | 0% 0% 100% 0% 0% 0% 0% 1% |
| 3.4 | Pyston #3 | 2.20 | 2.21 | 10,576 | 1354 | 1% 1% 100% 0% 1% 0% 0% 0% |
| 3.5 | Python 3 | 2.23 | 2.23 | 10,896 | 1540 | 0% 0% 1% 100% 0% 0% 1% 1% |
| 3.6 | Cython #3 | 2.35 | 2.35 | 11,184 | 1334 | 100% 0% 0% 0% 2% 1% 0% 0% |
| 4.0 | Nuitka #3 | 2.55 | 2.55 | 13,184 | 1334 | 0% 100% 1% 0% 1% 0% 0% 0% |
| 4.1 | Python development version #3 | 2.62 | 2.62 | 11,232 | 1334 | 0% 0% 0% 1% 1% 2% 100% 0% |
| 4.3 | Python 3 #3 | 2.76 | 2.77 | 12,884 | 1334 | 100% 0% 0% 0% 1% 0% 0% 0% |
| 4.6 | Python 2 | 2.94 | 2.94 | 6,436 | 1579 | 0% 100% 1% 0% 0% 0% 0% 1% |
| 5.7 | Python 2 #3 | 3.69 | 3.69 | 7,344 | 1354 | 0% 100% 0% 0% 1% 1% 1% 0% |
| 7.5 | Graal #3 | 15.04 | 4.84 | 1,102,264 | 1334 | 63% 9% 64% 30% 71% 6% 22% 52% |
| 8.5 | Jython #2 | 9.64 | 5.51 | 3,432 | 1485 | 58% 22% 17% 13% 14% 12% 24% 17% |
| 11 | Jython #3 | 12.13 | 6.84 | 3,588 | 1354 | 13% 21% 26% 8% 13% 72% 17% 10% |
| 11 | Jython | 12.37 | 7.05 | 3,664 | 1579 | 16% 17% 24% 21% 70% 17% 8% 7% |
| 44 | RustPython #2 | 28.27 | 28.27 | 16,400 | 1443 | 35% 1% 1% 0% 66% 0% 0% 1% |
| 56 | RustPython | 36.08 | 36.08 | 16,044 | 1540 | 1% 1% 1% 1% 0% 1% 0% 100% |
| missing benchmark programs | ||||||
| IronPython | No program | |||||
| Shedskin | No program | |||||
| Numba | No program | |||||
| MicroPython | No program | |||||
| Grumpy | 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.
The Meteor Puzzle and 3 Java puzzle solvers are described in "Optimize your Java application's performance" (pdf).