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 12:30Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:32Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:32045,406,37836,352,0001,215,0002,117,632expected "74600294196621100 ", got "24424476292919084 "
2Jul 7, 2026 03:32044,734,29835,788,0001,120,0002,117,632expected "74600294196621100 ", got "24424476292919084 "
3Jul 7, 2026 03:32044,779,87135,808,0001,117,0002,117,632expected "74600294196621100 ", got "24424476292919084 "
4Mar 31, 2026 12:304,67971,382,88837,841,000995,0002,535,424
5Mar 31, 2026 12:304,93969,129,07939,991,000999,0002,469,888
6Mar 31, 2026 12:304,94464,044,05440,036,0001,000,0002,535,424