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 7, 2026 00:58Victor MerckléVictor MerckléScore: 7,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 01:007,72114,183,0486,795,00002,113,536
2Jun 7, 2026 01:007,73414,185,3016,806,00002,113,536
3Jun 7, 2026 01:007,74014,165,4946,812,00002,113,536
4Jun 7, 2026 01:007,74514,215,5606,816,00002,113,536
5Jun 7, 2026 01:007,77214,172,6416,840,00002,113,536
6Jun 7, 2026 01:007,79214,255,6596,857,00002,113,536
7Jun 7, 2026 01:007,92914,381,4146,978,00002,113,536
8Jun 7, 2026 01:008,08914,714,8477,119,00002,113,536
9Jun 7, 2026 01:008,09714,506,4967,126,00002,113,536