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 20, 2026 18:45Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:46M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:46010,551,9381,512,00002,117,632expected "6442459076 ", got "2147490633 "
2May 17, 2026 07:4608,598,4361,504,00002,117,632expected "6442459076 ", got "2147490633 "
3May 17, 2026 07:46010,710,9551,513,00002,117,632expected "6442459076 ", got "2147490633 "
4Jan 20, 2026 18:4511,48926,517,4237,077,0003,033,0002,281,472
5Jan 20, 2026 18:4511,52626,171,0497,100,0003,043,0002,359,296
6Jan 20, 2026 18:4511,68227,398,3698,224,0002,056,0002,277,376