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 21, 2026 14:03Johan SannemoJohan SannemoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 12:55M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 12:57013,390,35701,953,0002,121,728expected "6442459076 ", got "2147484645 "
2May 17, 2026 12:57012,526,10401,837,0002,121,728expected "6442459076 ", got "2147484645 "
3May 17, 2026 12:57011,214,92001,977,0002,121,728expected "6442459076 ", got "2147484645 "
4Jan 21, 2026 14:038,67423,497,6825,452,0002,181,0002,281,472
5Jan 21, 2026 14:038,70828,309,1655,474,0002,189,0002,285,568
6Jan 21, 2026 14:038,76923,660,0146,615,0001,102,0002,490,368