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 listMar 21, 2026 15:17olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:07Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:10054,619,34743,208,0001,270,0002,129,920expected "20574477877359 ", got "7714036125727 "
2Oct 5, 2026 21:10052,784,67441,445,0001,262,0002,174,976expected "20690324019365 ", got "7957128152395 "
3Oct 5, 2026 21:10035,975,91723,044,0001,287,0002,170,880expected "39927276467703 ", got "14508790275369 "
4Mar 21, 2026 15:1739,55062,093,87731,821,0002,983,0002,281,472
5Mar 21, 2026 15:1739,65563,183,33033,899,000997,0002,523,136
6Mar 21, 2026 15:1739,76860,637,49733,997,000999,0002,527,232