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 26, 2026 20:26Victor MerckléVictor MerckléScore: 5,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 20:285,75512,635,7315,065,00002,117,632stderr
2Jun 26, 2026 20:285,81012,580,5885,113,00002,117,632stderr
3Jun 26, 2026 20:285,81312,951,4495,116,00002,117,632stderr
4Jun 26, 2026 20:285,82812,643,5295,129,00002,117,632stderr
5Jun 26, 2026 20:285,83012,606,0635,131,00002,117,632stderr
6Jun 26, 2026 20:285,84012,963,0845,140,00002,117,632stderr
7Jun 26, 2026 20:285,84212,579,9945,141,00002,117,632stderr
8Jun 26, 2026 20:285,85612,991,1475,154,00002,117,632stderr
9Jun 26, 2026 20:285,93212,802,6205,221,00002,117,632stderr