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 5, 2026 11:48Victor MerckléVictor MerckléScore: 9,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 11:519,50115,835,8108,361,00002,113,536
2Jun 5, 2026 11:519,51315,861,5978,372,00002,113,536
3Jun 5, 2026 11:519,53115,853,6158,388,00002,113,536
4Jun 5, 2026 11:519,55915,896,8678,412,00002,113,536
5Jun 5, 2026 11:519,59615,868,3648,445,00002,113,536
6Jun 5, 2026 11:519,62316,254,0518,469,00002,113,536
7Jun 5, 2026 11:519,63915,989,5428,483,00002,113,536
8Jun 5, 2026 11:519,64215,973,6368,485,00002,113,536
9Jun 5, 2026 11:519,65215,923,7718,494,00002,113,536