Mini JSON parse

Hand-rolled JSON parser over a 100 KiB document with mixed nesting.

Compile time · median (cold)

median of 10 runs

Native Gocompiled

182 ms67.4×

Piko interpbytecode VM

2.69 msbaseline

CPython 3.13bytecode VM

732 µs0.27×

PyPy 7.3tracing JIT

574 µs0.21×

Ttengobytecode VM

unsupported in tengo

n/a

Sscriggobytecode VM

unsupported in scriggo

n/a

Mmvmbytecode VM

815 µs0.30×

YyaegiAST walker

732 µs0.27×

Runner	N	Compile	Runtime	P95	Stddev	RSS	vs piko	Status
Native Gocompiled	10	182 ms	12.6 ms	12.8 ms	272 µs	68 MiB	67.4×	OK
Piko interpbytecode VM	10	2.69 ms	208 ms	232 ms	10.4 ms	2.38 GiB	1.00×	OK
CPython 3.13bytecode VM	10	732 µs	186 ms	189 ms	3.74 ms	n/a	0.27×	OK
PyPy 7.3tracing JIT	10	574 µs	101 ms	104 ms	1.88 ms	n/a	0.21×	OK
tengobytecode VM	0	n/a	n/a	n/a	n/a	n/a	n/a	unsupported
scriggobytecode VM	0	n/a	n/a	n/a	n/a	n/a	n/a	unsupported
mvmbytecode VM	10	815 µs	434 ms	478 ms	24.1 ms	148 MiB	0.30×	OK
yaegiAST walker	10	732 µs	2.14 s	2.36 s	86.5 ms	1.13 GiB	0.27×	OK

Workload & symmetry rules

Workload

Parse a 100 KiB JSON document into a generic tree, then walk the tree and sum every integer node. Print the sum.

Source code