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 5, 2026 11:43Victor MerckléVictor MerckléScore: 9,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 11:469,51015,878,8228,369,00002,113,536
2Jun 5, 2026 11:469,57315,850,1518,425,00002,113,536
3Jun 5, 2026 11:469,58515,895,4478,435,00002,113,536
4Jun 5, 2026 11:469,61015,876,7518,457,00002,113,536
5Jun 5, 2026 11:469,61815,864,2428,464,00002,113,536
6Jun 5, 2026 11:469,62016,326,5478,466,00002,113,536
7Jun 5, 2026 11:469,62515,974,8438,470,00002,113,536
8Jun 5, 2026 11:469,65915,960,1838,500,00002,113,536
9Jun 5, 2026 11:469,69415,965,8138,531,00002,113,536