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 listAug 19, 2026 15:45Victor MerckléVictor MerckléScore: 3,353Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 02:32Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:493,32511,114,4742,926,00002,117,632stderr
2Aug 19, 2026 15:493,33711,139,5512,937,00002,117,632stderr
3Aug 19, 2026 15:493,34511,193,1912,944,00002,117,632stderr
4Aug 19, 2026 15:493,35111,177,2812,949,00002,117,632stderr
5Aug 19, 2026 15:493,35311,213,7792,951,00002,117,632stderr
6Aug 19, 2026 15:493,43611,745,6253,024,00002,117,632stderr
7Aug 19, 2026 15:493,43911,853,6793,027,00002,117,632stderr
8Aug 19, 2026 15:493,45111,777,9733,037,00002,117,632stderr
9Aug 19, 2026 15:493,45511,053,5443,041,00002,117,632stderr