Euclidean GCD loop
numerical · number_theory
Compute the greatest common divisor for many integer pairs.
🏆 Winner
pyvorin-project-venv with a warm median of 1.6884 ms — 1.06x faster than codon-system (5.3% quicker)
Adapter Comparison
Latest Results by Adapter
| Adapter | Warm median ms | Warm mean ms | Cold median ms | Success |
|---|---|---|---|---|
| pyvorin-project-venv 🏆 | 1.6884 | 1.6886 | 1.8541 | 100% |
| codon-system | 1.7838 | 1.8206 | 1.8508 | 100% |
| pypy3-system | 2.4034 | 2.3995 | 4.5257 | 100% |
| cpython-system | 12.4839 | 12.5051 | 12.1569 | 100% |
| graalpy-system | 18.9962 | 19.9072 | 24.6808 | 100% |
Trend Series
Recent Snapshots
| Recorded at | Adapter | Parameter set | Warm median ms | Success rate |
|---|---|---|---|---|
| 2026-07-19 12:39:15.303987 | pyvorin-project-venv | small | 1.6884 | 100% |
| 2026-07-19 12:34:20.500963 | pypy3-system | small | 2.4034 | 100% |
| 2026-07-19 12:33:39.078672 | graalpy-system | small | 18.9962 | 100% |
| 2026-07-19 12:30:56.416123 | cpython-system | small | 12.4839 | 100% |
| 2026-07-19 12:29:38.004849 | codon-system | small | 1.7838 | 100% |
| 2026-07-19 09:17:44.669278 | pyvorin-project-venv | small | 1.7258 | 100% |
| 2026-07-19 09:12:59.196077 | pypy3-system | small | 2.4230 | 100% |
| 2026-07-19 09:12:18.895119 | graalpy-system | small | 19.6916 | 100% |
| 2026-07-19 09:08:40.845895 | cpython-system | small | 12.3518 | 100% |
| 2026-07-19 09:05:33.080437 | pypy3-system | small | 2.4214 | 100% |
| 2026-07-19 09:04:52.023736 | graalpy-system | small | 23.2750 | 100% |
| 2026-07-19 09:02:15.144970 | cpython-system | small | 12.6506 | 100% |
| 2026-07-19 09:00:48.988114 | codon-system | small | 0.0000 | 0% |
| 2026-07-19 08:03:32.976616 | pyvorin-project-venv | small | 1.6996 | 100% |
| 2026-07-19 07:56:44.489289 | cpython-system | small | 12.6181 | 100% |