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 17, 2026 02:48zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:17M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:1709,160,8831,197,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 07:17010,916,8451,206,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 07:1708,783,5461,108,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 17, 2026 02:483,48221,219,3792,043,0001,021,0002,494,464
5Jan 17, 2026 02:483,51125,058,9401,030,0002,060,0002,277,376
6Jan 17, 2026 02:484,44918,157,5863,915,00002,387,968