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 29, 2026 08:47Victor MerckléVictor MerckléScore: 3,262Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 23:37Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 08:493,24710,998,3242,858,00002,117,632stderr
2Aug 29, 2026 08:493,25211,118,8252,862,00002,117,632stderr
3Aug 29, 2026 08:493,25411,073,5572,864,00002,117,632stderr
4Aug 29, 2026 08:493,25511,128,3542,865,00002,117,632stderr
5Aug 29, 2026 08:493,26211,080,5912,871,00002,117,632stderr
6Aug 29, 2026 08:493,35911,154,3512,956,00002,117,632stderr
7Aug 29, 2026 08:493,36211,124,7272,959,00002,117,632stderr
8Aug 29, 2026 08:493,36911,151,4372,965,00002,117,632stderr
9Aug 29, 2026 08:493,36911,109,8142,965,00002,117,632stderr