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 listSep 2, 2026 16:14Victor MerckléVictor MerckléScore: 2,759Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 04:46Tomislav Tunkovic34.37CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 16:162,73910,485,6722,411,000024,576stderr
2Sep 2, 2026 16:162,74610,609,5112,417,000024,576stderr
3Sep 2, 2026 16:162,75310,626,3402,423,000024,576stderr
4Sep 2, 2026 16:162,75410,512,3322,424,000024,576stderr
5Sep 2, 2026 16:162,75911,160,3362,428,000024,576stderr
6Sep 2, 2026 16:162,76110,539,7922,430,000024,576stderr
7Sep 2, 2026 16:162,76210,647,7952,431,000024,576stderr
8Sep 2, 2026 16:162,76510,755,1112,434,000024,576stderr
9Sep 2, 2026 16:162,77511,893,0902,442,000024,576stderr