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 19:24Victor MerckléVictor MerckléScore: 7,477Success
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 19:277,33913,680,8796,459,00002,113,536
2Jun 9, 2026 19:277,34413,648,1636,463,00002,113,536
3Jun 9, 2026 19:277,43813,694,7746,546,00002,113,536
4Jun 9, 2026 19:277,44313,694,1966,550,00002,113,536
5Jun 9, 2026 19:277,47713,964,3166,580,00002,113,536
6Jun 9, 2026 19:277,48014,090,7806,583,00002,113,536
7Jun 9, 2026 19:277,51314,248,5406,612,00002,113,536
8Jun 9, 2026 19:277,62214,208,0716,708,00002,113,536
9Jun 9, 2026 19:277,76214,251,0526,831,00002,113,536