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 02:55Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:45M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:45010,704,5171,654,00002,117,632expected "6442459076 ", got "84496316980 "
2May 17, 2026 07:45010,368,4501,749,00002,117,632expected "6442459076 ", got "84496316980 "
3May 17, 2026 07:4508,870,6311,756,00002,117,632expected "6442459076 ", got "84496316980 "
4Jan 21, 2026 02:5511,43827,835,2249,059,0001,006,0002,281,472
5Jan 21, 2026 02:5511,48424,462,4469,096,0001,010,0002,506,752
6Jan 21, 2026 02:5511,57723,706,8888,151,0002,037,0002,510,848