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 11:58Victor MerckléVictor MerckléScore: 3,140Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 23:49Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 12:003,12710,960,3332,752,00002,117,632stderr
2Aug 29, 2026 12:003,12910,949,6192,754,00002,117,632stderr
3Aug 29, 2026 12:003,13010,936,4052,755,00002,117,632stderr
4Aug 29, 2026 12:003,13110,920,9222,756,00002,117,632stderr
5Aug 29, 2026 12:003,14010,992,0952,764,00002,117,632stderr
6Aug 29, 2026 12:003,23510,943,3322,847,00002,117,632stderr
7Aug 29, 2026 12:003,23811,362,2622,850,00002,117,632stderr
8Aug 29, 2026 12:003,24310,975,0112,854,00002,117,632stderr
9Aug 29, 2026 12:003,24511,008,4812,856,00002,117,632stderr