Levenshtein, 1k pairs

Edit-distance between 1,000 pre-generated string pairs of length 24–48.

Runtime · median per inner-loop window

median of 7 runs

Native Gocompiled

5.29 ms0.07×

Pipitbytecode VM

74.9 msbaseline

CPython 3.14bytecode VM

174 ms2.32×

PyPy 7.3tracing JIT

30.2 ms0.40×

Ttengobytecode VM

622 ms8.31×

Sscriggobytecode VM

318 ms4.24×

Mmvmbytecode VM

474 ms6.33×

YyaegiAST walker

694 ms9.27×

Runner	N	Compile	Runtime	P95	Stddev	RSS	vs pipit	Status
Native Gocompiled	7	109 ms	5.29 ms	5.29 ms	69.3 µs	197 MiB	0.07×	OK
Pipitbytecode VM	7	1.18 ms	74.9 ms	76.2 ms	972 µs	114 MiB	1.00×	OK
CPython 3.14bytecode VM	7	439 µs	174 ms	176 ms	1.32 ms	n/a	2.32×	OK
PyPy 7.3tracing JIT	7	326 µs	30.2 ms	33.2 ms	1.18 ms	n/a	0.40×	OK
tengobytecode VM	7	257 µs	622 ms	628 ms	25.9 ms	191 MiB	8.31×	OK
scriggobytecode VM	7	400 µs	318 ms	343 ms	13.0 ms	191 MiB	4.24×	OK
mvmbytecode VM	7	360 µs	474 ms	497 ms	11.6 ms	191 MiB	6.33×	OK
yaegiAST walker	7	364 µs	694 ms	740 ms	29.5 ms	191 MiB	9.27×	OK

Workload & symmetry rules

Workload

For each of 1,000 pre-generated pairs, compute classical 2-row Levenshtein distance. Sum the distances and print the total.

Source code