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 06:56Victor MerckléVictor MerckléScore: 5,926Success
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 06:595,86812,992,7615,164,00002,113,536
2Jun 23, 2026 06:595,88212,933,4785,177,00002,113,536
3Jun 23, 2026 06:595,90012,726,0975,192,00002,113,536
4Jun 23, 2026 06:595,90712,662,3665,199,00002,113,536
5Jun 23, 2026 06:595,92613,008,8765,215,00002,113,536
6Jun 23, 2026 06:595,95716,559,1345,243,00002,113,536
7Jun 23, 2026 06:595,99213,299,6015,273,00002,113,536
8Jun 23, 2026 06:596,00412,780,9035,284,00002,113,536
9Jun 23, 2026 06:596,01113,189,4265,290,00002,113,536