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 19, 2026 22:36Victor MerckléVictor MerckléScore: 6,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 22:386,95713,616,0386,123,00002,113,536
2Jun 19, 2026 22:386,97113,424,2726,135,00002,113,536
3Jun 19, 2026 22:386,97513,636,0396,138,00002,113,536
4Jun 19, 2026 22:386,98813,849,9186,150,00002,113,536
5Jun 19, 2026 22:386,99313,924,9906,154,00002,113,536
6Jun 19, 2026 22:386,99713,623,3656,158,00002,113,536
7Jun 19, 2026 22:387,00213,640,4976,162,00002,113,536
8Jun 19, 2026 22:387,01413,626,1966,173,00002,113,536
9Jun 19, 2026 22:387,24813,840,6216,379,00002,113,536