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 09:47Victor MerckléVictor MerckléScore: 5,727Success
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 09:505,59512,546,0934,924,00002,113,536
2Jun 23, 2026 09:505,63812,453,3094,962,00002,113,536
3Jun 23, 2026 09:505,72312,536,8145,037,00002,113,536
4Jun 23, 2026 09:505,72312,803,9425,037,00002,113,536
5Jun 23, 2026 09:505,72712,486,0775,040,00002,113,536
6Jun 23, 2026 09:505,73712,861,6915,049,00002,113,536
7Jun 23, 2026 09:505,75012,840,4955,060,00002,113,536
8Jun 23, 2026 09:505,75012,520,3145,060,00002,113,536
9Jun 23, 2026 09:505,80312,582,3005,107,00002,113,536