Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listApr 13, 2026 18:21Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:21Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:21055,448,68238,972,0001,203,0002,117,632expected "74600294196621100 ", got "15435121633570604 "
2Jul 7, 2026 03:21053,396,27336,766,0001,183,0002,117,632expected "74600294196621100 ", got "15435121633570604 "
3Jul 7, 2026 03:21056,733,30838,361,0001,010,0002,117,632expected "74600294196621100 ", got "15435121633570604 "
4Apr 13, 2026 18:204,77165,992,44138,586,0001,015,0002,482,176
5Apr 13, 2026 18:204,79970,952,00637,837,0001,991,0002,273,280
6Apr 13, 2026 18:204,79964,740,23938,837,000995,0002,535,424
7Apr 13, 2026 18:214,79965,645,23337,840,0001,991,0002,535,424
8Apr 13, 2026 18:214,94067,738,36338,999,0001,999,0002,478,080
9Apr 13, 2026 18:215,01068,841,98340,565,0001,014,0002,535,424