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 1, 2025 17:08zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:40M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:4108,804,2721,320,00002,117,632expected "6442459076 ", got "2305422578 "
2May 17, 2026 07:41010,513,9461,284,00002,117,632expected "6442459076 ", got "2305422578 "
3May 17, 2026 07:4109,523,1451,313,00002,117,632expected "6442459076 ", got "2305422578 "
4Jan 1, 2025 17:083,51318,044,0922,061,0001,030,0002,457,600
5Jan 1, 2025 17:083,55719,339,9431,043,0002,087,0002,535,424
6Jan 1, 2025 17:083,60723,952,8401,058,0002,116,0002,457,600