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 13:01Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:55Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:56045,005,86135,974,0001,110,0002,117,632expected "74600294196621100 ", got "18248072388194092 "
2Jul 7, 2026 03:56045,717,48436,434,0001,192,0002,117,632expected "74600294196621100 ", got "16569695428147112 "
3Jul 7, 2026 03:56046,520,66837,417,0001,177,0002,117,632expected "74600294196621100 ", got "18248072388194092 "
4Mar 31, 2026 13:014,68164,202,56236,862,0001,992,0002,273,280
5Mar 31, 2026 13:015,03767,528,50839,817,0001,990,0002,535,424
6Mar 31, 2026 13:015,03971,640,29139,834,0001,991,0002,535,424