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 31, 2026 14:48Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:53Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:53046,839,45937,763,0001,174,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
2Jul 7, 2026 03:53046,121,37336,821,0001,192,0002,117,632expected "74600294196621100 ", got "15171594096238880 "
3Jul 7, 2026 03:53045,465,02036,315,0001,100,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
4Mar 31, 2026 14:484,75263,547,03238,427,0001,011,0002,469,888
5Mar 31, 2026 14:484,96568,853,92439,201,0002,010,0002,473,984
6Mar 31, 2026 14:484,98567,586,97140,364,0001,009,0002,478,080