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 8, 2026 00:37Victor MerckléVictor MerckléScore: 7,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 00:407,37313,836,4856,489,00002,113,536
2Jun 8, 2026 00:407,38613,764,3696,500,00002,113,536
3Jun 8, 2026 00:407,40213,812,0576,514,00002,113,536
4Jun 8, 2026 00:407,40713,807,3326,519,00002,113,536
5Jun 8, 2026 00:407,41114,068,6846,522,00002,113,536
6Jun 8, 2026 00:407,48714,167,1516,589,00002,113,536
7Jun 8, 2026 00:407,48913,870,5286,591,00002,113,536
8Jun 8, 2026 00:407,50414,214,9936,604,00002,113,536
9Jun 8, 2026 00:407,53513,897,0786,631,00002,113,536