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 18:09CheckHarryCheckHarryScore: 5,983Success
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 18:105,97359,383,06748,526,0001,050,0002,113,536
2Sep 2, 2026 18:105,97359,730,41548,523,0001,053,0002,113,536
3Sep 2, 2026 18:105,97959,480,10748,584,0001,042,0002,113,536
4Sep 2, 2026 18:105,98159,517,70548,576,0001,074,0002,113,536
5Sep 2, 2026 18:105,98359,475,61248,620,0001,042,0002,113,536
6Sep 2, 2026 18:105,99359,552,80448,635,0001,108,0002,113,536
7Sep 2, 2026 18:106,01068,228,90048,766,0001,119,0002,113,536
8Sep 2, 2026 18:106,01771,275,00548,822,0001,121,0002,113,536
9Sep 2, 2026 18:106,28771,431,00151,167,0001,020,0002,113,536