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 listJan 23, 2026 04:02zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:03M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:03011,349,2871,107,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 07:03010,140,2881,116,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 07:03011,349,3211,118,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 23, 2026 04:023,37819,020,2271,982,000991,0002,277,376
5Jan 23, 2026 04:023,46816,607,4922,035,0001,017,0002,277,376
6Jan 23, 2026 04:023,47017,038,1512,036,0001,018,0002,494,464