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 6, 2026 06:56Victor MerckléVictor MerckléScore: 9,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 06:599,53215,836,0218,389,00002,113,536
2Jun 6, 2026 06:599,55615,889,4808,410,00002,113,536
3Jun 6, 2026 06:599,57315,889,9258,425,00002,113,536
4Jun 6, 2026 06:599,58915,898,1028,439,00002,113,536
5Jun 6, 2026 06:599,65915,980,4188,500,00002,113,536
6Jun 6, 2026 06:599,66415,904,7478,505,00002,113,536
7Jun 6, 2026 06:599,68115,942,8778,520,00002,113,536
8Jun 6, 2026 06:599,68816,006,4308,526,00002,113,536
9Jun 6, 2026 06:599,70415,949,5228,540,00002,113,536