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 10, 2025 01:01zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:14M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:1409,251,4831,095,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 07:14010,697,9731,245,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 07:1408,694,3121,101,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 10, 2025 01:013,46119,553,3132,031,0001,015,0002,539,520
5Jan 10, 2025 01:013,49516,833,1482,051,0001,025,0002,510,848
6Jan 10, 2025 01:013,52519,272,0021,034,0002,068,0002,289,664