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:08CheckHarryCheckHarryScore: 6,555Success
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:096,50465,071,91852,921,0001,070,0002,113,536
2Sep 2, 2026 17:096,53164,160,73253,158,0001,054,0002,113,536
3Sep 2, 2026 17:096,55164,213,09153,338,0001,042,0002,113,536
4Sep 2, 2026 17:096,55464,221,27153,364,0001,042,0002,113,536
5Sep 2, 2026 17:096,55564,320,28453,374,0001,039,0002,113,536
6Sep 2, 2026 17:096,56864,313,30653,383,0001,138,0002,113,536
7Sep 2, 2026 17:096,57964,394,48553,562,0001,051,0002,113,536
8Sep 2, 2026 17:096,60365,361,73153,752,0001,059,0002,113,536
9Sep 2, 2026 17:097,10668,873,60157,870,0001,112,0002,113,536