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 09:47Victor MerckléVictor MerckléScore: 4,556Success
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 09:494,43011,754,6313,899,00002,117,632stderr
2Jul 5, 2026 09:494,43611,766,3713,904,00002,117,632stderr
3Jul 5, 2026 09:494,43911,742,6723,907,00002,117,632stderr
4Jul 5, 2026 09:494,45411,778,4583,920,00002,117,632stderr
5Jul 5, 2026 09:494,55611,752,1794,010,00002,117,632stderr
6Jul 5, 2026 09:494,56412,131,4844,017,00002,117,632stderr
7Jul 5, 2026 09:494,56811,761,8154,020,00002,117,632stderr
8Jul 5, 2026 09:494,57212,176,1174,024,00002,117,632stderr
9Jul 5, 2026 09:495,63213,207,3433,690,0001,267,0002,117,632stderr