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 9, 2026 20:12Victor MerckléVictor MerckléScore: 7,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 20:147,43213,950,1656,541,00002,113,536
2Jun 9, 2026 20:147,44013,778,6246,548,00002,113,536
3Jun 9, 2026 20:147,46013,777,9006,565,00002,113,536
4Jun 9, 2026 20:147,53014,232,4236,627,00002,113,536
5Jun 9, 2026 20:147,53413,990,7406,630,00002,113,536
6Jun 9, 2026 20:147,53514,244,4156,631,00002,113,536
7Jun 9, 2026 20:147,54714,305,7936,642,00002,113,536
8Jun 9, 2026 20:147,54813,958,7596,643,00002,113,536
9Jun 9, 2026 20:147,71814,250,3386,792,00002,113,536