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 23, 2026 03:59zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 06:52M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:5209,277,4971,136,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 06:5208,847,9301,123,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 06:5208,393,8181,136,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 23, 2026 03:593,40320,028,9731,997,000998,0002,351,104
5Jan 23, 2026 03:593,45521,926,9081,013,0002,027,0002,338,816
6Jan 23, 2026 03:594,23821,460,1732,486,0001,243,0002,338,816