Host
Intel Core Ultra 9 285K · 24 cores
Platform
linux/amd64
Go
go1.26.0
CPython
python:3.13-slim
PyPy
pypy:3.10-slim
Runs / combo
10 + 2 warmup

Game of Life

200×200 Conway's Game of Life for 1,000 generations on a wrap-around grid.

Compile time · median (cold)

median of 10 runs

Native Gocompiled
181 ms112×
Piko interpbytecode VM
1.61 msbaseline
CPython 3.13bytecode VM
341 µs0.21×
PyPy 7.3tracing JIT
292 µs0.18×
Ttengobytecode VM
253 µs0.16×
Sscriggobytecode VM
443 µs0.27×
Mmvmbytecode VM
n/a
YyaegiAST walker
334 µs0.21×

Full statistics

RunnerNCompileRuntimeP95StddevRSSvs pikoStatus
Native Gocompiled10181 ms97.0 ms104 ms9.86 ms69 MiB112×OK
Piko interpbytecode VM101.61 ms4.64 s4.70 s30.9 ms106 MiB1.00×OK
CPython 3.13bytecode VM10341 µs5.99 s6.06 s72.2 msn/a0.21×OK
PyPy 7.3tracing JIT10292 µs151 ms155 ms2.17 msn/a0.18×OK
tengobytecode VM10253 µs10.7 s10.8 s89.3 ms2.39 GiB0.16×OK
scriggobytecode VM10443 µs6.67 s6.77 s92.2 ms82 MiB0.27×OK
mvmbytecode VM0n/an/an/an/an/an/aunsupported
yaegiAST walker10334 µs10.5 s10.7 s95.2 ms71 MiB0.21×OK
Workload & symmetry rules

Workload

Double-buffered 200×200 cell grid. Wrap-around boundary. 1,000 generations from a glider gun start state. Print the final live-cell count.

Symmetry rules

  • Two flat byte arrays, no numpy / fancy slicing.
  • Neighbour sum unrolled by hand.
Source code