Tirsvad/prime-numbers-c

T

Tirsvad c59fdf04cf

Publish wiki / publish-wiki (push) Successful in 19s

Details

Publish wiki / wiki (push) Successful in 19s

Details

TirSystem/github-action: Sync GitHub mirror metadata / sync-metadata (push) Successful in 5s

Details

Merge pull request 'Wiki in English, Danish and Malay, AVX2 explanation, README' (#3 ) from docs/wiki-and-dist-build into main

2026-10-19 19:42:17 +02:00

.gitea/workflows

Call publish-wiki-pages at v2 (v1 tag does not exist)

2026-10-20 01:30:00 +08:00

Add Danish and Malay wiki pages with language switcher

2026-10-20 01:39:47 +08:00

Explain AVX2 prime check in the wiki and comment every step in the code

2026-10-20 01:38:19 +08:00

.gitignore

Build into dist/, list primes to 1,000,000 with timing, add wiki

2026-10-20 01:07:36 +08:00

LICENSE

Initial commit

2026-10-19 17:40:04 +02:00

Makefile

Build into dist/, list primes to 1,000,000 with timing, add wiki

2026-10-20 01:07:36 +08:00

README.md

Update README with description, result, build and layout

2026-10-20 01:33:03 +08:00

README.md

prime-numbers-c

Lists every prime number from 0 to 1,000,000 and reports how long the search took. It shows how fast a CPU is, but the result depends on how the program is written: algorithm, instruction set (here AVX2), compiler and flags.

Example result on a 13th Gen Intel(R) Core(TM) i5-13600K:

Found 78498 primes from 0 to 1000000 in 20.977 ms

Build and run

Needs gcc (Linux, or MinGW-w64 / MSYS2 on Windows), make and a CPU with AVX2.

make

make run

make clean

The executable is built into dist/. The primes go to standard output and the timing line to standard error, so this saves the list and still shows the time:

./dist/prime_avx2 > primes.txt

Layout

Path	Content
`src/prime_avx2.c`	the program
`Makefile`	build rules
`docs/wiki/`	wiki pages, published to the Gitea wiki by `.gitea/workflows/publish-wiki.yml`

Documentation

See the wiki: Description, Results and Build and run.

License