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:36zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 05:26M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 05:26010,110,989957,00002,113,536expected "6442459076 ", got "2305422625 "
2May 17, 2026 05:2609,189,4051,049,00002,113,536expected "6442459076 ", got "2305422625 "
3May 17, 2026 05:2608,829,677970,00002,113,536expected "6442459076 ", got "2305422625 "
4Jan 17, 2026 02:363,36024,714,4082,957,00002,359,296
5Jan 17, 2026 02:363,39318,270,2731,991,000995,0002,355,200
6Jan 17, 2026 02:363,40219,926,8211,996,000998,0002,359,296