Sum of prime numbers Andrey Tsvetkov

Compute the sum of all prime numbers in a stream of binary integers as fast as possible.

Input: 1 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of all values that are prime, printed as a decimal string.

Back to listJul 5, 2026 05:22Victor MerckléVictor MerckléScore: 4,621Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 05:254,58411,891,4674,034,00002,117,632stderr
2Jul 5, 2026 05:254,60511,853,9294,053,00002,117,632stderr
3Jul 5, 2026 05:254,60711,792,1394,055,00002,117,632stderr
4Jul 5, 2026 05:254,61711,799,1934,063,00002,117,632stderr
5Jul 5, 2026 05:254,62111,887,2854,067,00002,117,632stderr
6Jul 5, 2026 05:254,63511,888,1134,079,00002,117,632stderr
7Jul 5, 2026 05:254,63611,826,4704,080,00002,117,632stderr
8Jul 5, 2026 05:254,64311,971,2954,086,00002,117,632stderr
9Jul 5, 2026 05:254,77011,981,4654,198,00002,117,632stderr