This is a test of how fast I can write a prime sieve, although I am no expert. Then I added in some Github Actions and Python code to run these tests everyday, and generate graphs of the preformance over time. The following is some auto-generated statistics from the last test ran:
| Test | Runtime (s) |
|---|---|
| 500000 @ -O0 | 0.036894 |
| 500000 @ -O1 | 0.037529 |
| 500000 @ -O2 | 0.036944 |
| 500000 @ -O3 | 0.037230 |
| 1000000 @ -O0 | 0.100292 |
| 1000000 @ -O1 | 0.101476 |
| 1000000 @ -O2 | 0.101944 |
| 1000000 @ -O3 | 0.102952 |
| 5000000 @ -O0 | 3.752260 |
| 5000000 @ -O1 | 3.484926 |
| 5000000 @ -O2 | 3.329882 |
| 5000000 @ -O3 | 4.018893 |
| 10000000 @ -O0 | 13.653681 |
| 10000000 @ -O1 | 15.914370 |
| 10000000 @ -O2 | 15.529029 |
| 10000000 @ -O3 | 15.264329 |
Generated at 07/07/24 EST
Copyright (C) 2024 HeronErin
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.