Trie of 50k words

Insert 50k dictionary words into a trie; perform 10k prefix queries.

Compile time · median (cold)

median of 10 runs

Native Gocompiled

183 ms151×

Piko interpbytecode VM

1.21 msbaseline

CPython 3.13bytecode VM

381 µs0.32×

PyPy 7.3tracing JIT

318 µs0.26×

Ttengobytecode VM

270 µs0.22×

Sscriggobytecode VM

unsupported in scriggo

n/a

Mmvmbytecode VM

406 µs0.34×

YyaegiAST walker

470 µs0.39×

Runner	N	Compile	Runtime	P95	Stddev	RSS	vs piko	Status
Native Gocompiled	10	183 ms	8.60 ms	8.78 ms	72.8 µs	68 MiB	151×	OK
Piko interpbytecode VM	10	1.21 ms	527 ms	531 ms	2.36 ms	142 MiB	1.00×	OK
CPython 3.13bytecode VM	10	381 µs	547 ms	570 ms	9.25 ms	n/a	0.32×	OK
PyPy 7.3tracing JIT	10	318 µs	52.9 ms	54.0 ms	663 µs	n/a	0.26×	OK
tengobytecode VM	10	270 µs	1.47 s	1.52 s	21.3 ms	2.22 GiB	0.22×	OK
scriggobytecode VM	0	n/a	n/a	n/a	n/a	n/a	n/a	unsupported
mvmbytecode VM	10	406 µs	1.28 s	1.31 s	11.2 ms	67 MiB	0.34×	OK
yaegiAST walker	10	470 µs	1.33 s	1.44 s	61.0 ms	66 MiB	0.39×	OK

Workload & symmetry rules

Workload

Build a 26-way trie from 50,000 lowercase ASCII words. Run 10,000 random prefix-existence queries. Print the count of hits.

Source code