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 07:12Victor MerckléVictor MerckléScore: 5,869Success
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 07:175,78012,701,5125,087,00002,113,536
2Jun 23, 2026 07:175,78412,569,5925,090,00002,113,536
3Jun 23, 2026 07:175,85412,683,3545,152,00002,113,536
4Jun 23, 2026 07:175,86012,996,9495,157,00002,113,536
5Jun 23, 2026 07:175,86912,695,5315,165,00002,113,536
6Jun 23, 2026 07:175,87612,914,6035,171,00002,113,536
7Jun 23, 2026 07:175,88812,838,1225,182,00002,113,536
8Jun 23, 2026 07:175,91813,022,6175,208,00002,113,536
9Jun 23, 2026 07:176,13012,900,0005,395,00002,113,536