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 listApr 14, 2026 18:08limanjun99limanjun99Error
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:16M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:45011,478,75702,269,0002,121,728expected "6442459076 ", got "2147491585"
2May 17, 2026 14:45012,115,95402,111,0002,121,728expected "6442459076 ", got "2147491585"
3May 17, 2026 14:45012,405,38302,297,0002,121,728expected "6442459076 ", got "2147491585"
4Apr 14, 2026 18:0817,29938,853,58113,194,0002,029,0002,441,216
5Apr 14, 2026 18:0817,48232,190,55214,359,0001,025,0002,457,600
6Apr 14, 2026 18:0817,51939,190,62412,334,0003,083,0002,506,752