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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:44Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:45049,467,02737,836,0002,081,0002,117,632expected "74600294196621100 ", got "35711894415295788 "
2Jul 7, 2026 05:45047,332,38436,720,0001,028,0002,117,632expected "74600294196621100 ", got "53520377721858604 "
3Jul 7, 2026 05:45047,335,45436,715,0001,027,0002,117,632expected "74600294196621100 ", got "53516013511566892 "
4Mar 21, 2026 07:215,68371,827,69541,145,0006,021,0002,486,272
5Mar 21, 2026 07:215,77668,178,80044,943,0002,996,0002,478,080
6Mar 21, 2026 07:215,84370,795,24845,466,0003,031,0002,338,816