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 23, 2026 08:21Victor MerckléVictor MerckléScore: 5,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 08:245,70712,517,6295,023,00002,113,536
2Jun 23, 2026 08:245,72312,524,8025,037,00002,113,536
3Jun 23, 2026 08:245,80312,606,5065,107,00002,113,536
4Jun 23, 2026 08:245,80612,505,9505,110,00002,113,536
5Jun 23, 2026 08:245,81312,568,5245,116,00002,113,536
6Jun 23, 2026 08:245,83412,653,0725,134,00002,113,536
7Jun 23, 2026 08:245,89312,672,2135,186,00002,113,536
8Jun 23, 2026 08:245,90712,983,2235,199,00002,113,536
9Jun 23, 2026 08:245,92912,676,6915,218,00002,113,536