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 3, 2026 12:54CheckHarryCheckHarryScore: 7,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 12:576,95667,581,34356,730,0001,011,0002,113,536
2Sep 3, 2026 12:577,02068,153,47357,263,0001,010,0002,113,536
3Sep 3, 2026 12:577,03368,243,37657,372,0001,010,0002,113,536
4Sep 3, 2026 12:577,04968,319,29157,498,0001,011,0002,113,536
5Sep 3, 2026 12:577,17469,423,14758,537,0001,011,0002,113,536
6Sep 3, 2026 12:577,23669,956,77559,055,0001,011,0002,113,536
7Sep 3, 2026 12:577,24169,914,05859,092,0001,010,0002,113,536
8Sep 3, 2026 12:577,32570,662,02959,790,0001,011,0002,113,536
9Sep 3, 2026 12:577,43082,027,15960,558,0001,117,0002,113,536