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 21, 2026 14:11Victor MerckléVictor MerckléScore: 6,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 14:146,87113,486,4226,047,00002,113,536
2Jun 21, 2026 14:146,87613,550,4246,051,00002,113,536
3Jun 21, 2026 14:146,88413,463,8096,058,00002,113,536
4Jun 21, 2026 14:146,89313,480,9236,066,00002,113,536
5Jun 21, 2026 14:146,94013,651,8496,108,00002,113,536
6Jun 21, 2026 14:146,97613,615,4686,139,00002,113,536
7Jun 21, 2026 14:147,00313,641,4836,163,00002,113,536
8Jun 21, 2026 14:147,00513,592,2416,165,00002,113,536
9Jun 21, 2026 14:147,07613,653,8686,227,00002,113,536