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 6, 2026 07:01Victor MerckléVictor MerckléScore: 9,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 07:049,13215,536,1088,037,00002,113,536
2Jun 6, 2026 07:049,15315,515,8248,055,00002,113,536
3Jun 6, 2026 07:049,15615,579,1548,058,00002,113,536
4Jun 6, 2026 07:049,15715,524,8188,059,00002,113,536
5Jun 6, 2026 07:049,17915,558,5508,078,00002,113,536
6Jun 6, 2026 07:049,19516,753,9358,092,00002,113,536
7Jun 6, 2026 07:049,20115,585,4948,097,00002,113,536
8Jun 6, 2026 07:049,22915,566,5708,122,00002,113,536
9Jun 6, 2026 07:049,27115,599,9588,159,00002,113,536