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 20, 2026 18:05Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 08:39M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:39010,035,0701,693,00002,121,728expected "6442459076 ", got "14817470387 "stderr
2May 17, 2026 08:39011,159,1571,685,00002,121,728expected "6442459076 ", got "14817470387 "stderr
3May 17, 2026 08:39010,742,9261,594,00002,121,728expected "6442459076 ", got "14817470387 "stderr
4Mar 20, 2026 18:0512,55930,529,0819,043,0002,009,0002,330,624
5Mar 20, 2026 18:0612,57628,374,57610,061,0001,006,0002,416,640
6Mar 20, 2026 18:0612,60329,472,6079,075,0002,016,0002,510,848
7Mar 20, 2026 18:0612,60625,133,30310,085,0001,008,0002,420,736
8Mar 20, 2026 18:0512,66334,692,8069,117,0002,026,0002,502,656
9Mar 20, 2026 18:0512,93331,151,5189,312,0002,069,0002,531,328