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 listJun 23, 2026 05:33Victor MerckléVictor MerckléScore: 6,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 05:375,99612,771,4435,277,00002,113,536
2Jun 23, 2026 05:376,05912,831,4245,332,00002,113,536
3Jun 23, 2026 05:376,07312,869,8375,345,00002,113,536
4Jun 23, 2026 05:376,07712,866,3385,348,00002,113,536
5Jun 23, 2026 05:376,08412,816,1615,354,00002,113,536
6Jun 23, 2026 05:376,09412,847,1885,363,00002,113,536
7Jun 23, 2026 05:376,17212,962,4275,432,00002,113,536
8Jun 23, 2026 05:376,33913,056,8835,579,00002,113,536
9Jun 23, 2026 05:376,45413,454,5405,680,00002,113,536