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 19, 2026 20:27Victor MerckléVictor MerckléScore: 6,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 20:306,85513,495,9066,033,00002,113,536
2Jun 19, 2026 20:306,86213,275,5966,039,00002,113,536
3Jun 19, 2026 20:306,88013,330,8396,055,00002,113,536
4Jun 19, 2026 20:306,96013,567,3246,125,00002,113,536
5Jun 19, 2026 20:306,97513,600,8096,138,00002,113,536
6Jun 19, 2026 20:306,98613,419,2196,148,00002,113,536
7Jun 19, 2026 20:306,99213,361,6386,153,00002,113,536
8Jun 19, 2026 20:307,05213,652,4006,206,00002,113,536
9Jun 19, 2026 20:307,09313,436,5196,242,00002,113,536