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 3, 2026 02:41Victor MerckléVictor MerckléScore: 4,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 02:444,45411,705,5173,920,00002,117,632stderr
2Jul 3, 2026 02:444,46111,704,9503,926,00002,117,632stderr
3Jul 3, 2026 02:444,46311,752,5153,928,00002,117,632stderr
4Jul 3, 2026 02:444,58711,707,0524,037,00002,117,632stderr
5Jul 3, 2026 02:444,58811,680,0544,038,00002,117,632stderr
6Jul 3, 2026 02:444,60211,712,6904,050,00002,117,632stderr
7Jul 3, 2026 02:444,61712,093,8724,063,00002,117,632stderr
8Jul 3, 2026 02:444,63911,757,0884,083,00002,117,632stderr
9Jul 3, 2026 02:444,92912,123,9164,338,00002,117,632stderr