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 listSep 2, 2026 17:44CheckHarryCheckHarryScore: 13,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 17:4413,388121,005,94553,332,00057,790,0002,117,632
2Sep 2, 2026 17:4413,423121,339,62853,669,00057,748,0002,117,632
3Sep 2, 2026 17:4413,423121,285,88853,540,00057,876,0002,117,632
4Sep 2, 2026 17:4413,478121,764,34853,364,00058,505,0002,117,632
5Sep 2, 2026 17:4413,489121,864,66853,463,00058,498,0002,117,632
6Sep 2, 2026 17:4413,583122,607,63053,184,00059,555,0002,117,632
7Sep 2, 2026 17:4413,706123,710,29253,576,00060,186,0002,117,632
8Sep 2, 2026 17:4413,743123,943,40455,369,00058,698,0002,117,632
9Sep 2, 2026 17:4413,868125,105,88153,301,00061,809,0002,117,632