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:43Victor MerckléVictor MerckléScore: 5,905Success
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:465,83112,618,1885,132,00002,113,536
2Jun 23, 2026 07:465,86412,642,8605,161,00002,113,536
3Jun 23, 2026 07:465,89013,023,0215,184,00002,113,536
4Jun 23, 2026 07:465,89212,989,2645,185,00002,113,536
5Jun 23, 2026 07:465,90513,010,8615,197,00002,113,536
6Jun 23, 2026 07:465,92312,743,0865,213,00002,113,536
7Jun 23, 2026 07:466,01813,123,3885,296,00002,113,536
8Jun 23, 2026 07:466,04713,136,7945,322,00002,113,536
9Jun 23, 2026 07:466,22112,985,8405,475,00002,113,536