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 09:21Victor MerckléVictor MerckléScore: 7,715Success
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 09:247,61714,204,1046,703,00002,113,536
2Jun 6, 2026 09:247,62514,102,4316,710,00002,113,536
3Jun 6, 2026 09:247,63014,131,3976,715,00002,113,536
4Jun 6, 2026 09:247,64714,199,3476,730,00002,113,536
5Jun 6, 2026 09:247,71514,266,7346,790,00002,113,536
6Jun 6, 2026 09:247,74514,299,9476,816,00002,113,536
7Jun 6, 2026 09:247,75114,148,7876,821,00002,113,536
8Jun 6, 2026 09:247,75914,204,1776,828,00002,113,536
9Jun 6, 2026 09:248,14514,870,8837,168,00002,113,536