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 22, 2026 03:15zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 06:44M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:44011,341,2021,096,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 06:44011,166,1621,083,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 06:4409,798,5571,172,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 22, 2026 03:153,43120,663,4341,006,0002,013,0002,363,392
5Jan 22, 2026 03:153,44720,876,3271,011,0002,022,0002,277,376
6Jan 22, 2026 03:153,45115,779,2442,025,0001,012,0002,359,296