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 21:01zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:38M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:38010,496,4141,335,00002,117,632expected "6442459076 ", got "2305422578 "
2May 17, 2026 07:38010,261,7931,341,00002,117,632expected "6442459076 ", got "2305422578 "
3May 17, 2026 07:38010,636,0931,334,00002,117,632expected "6442459076 ", got "2305422578 "
4Jan 1, 2025 21:013,51918,638,5851,032,0002,065,0002,461,696
5Jan 1, 2025 21:013,53616,751,3011,037,0002,075,0002,465,792
6Jan 1, 2025 21:014,45919,820,4042,943,000981,0002,457,600