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 12:13CheckHarryCheckHarryScore: 20,696Success
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 12:1420,440179,472,618168,629,0001,029,0002,113,536
2Sep 2, 2026 12:1420,455179,651,010168,744,0001,035,0002,113,536
3Sep 2, 2026 12:1420,458179,700,410168,773,0001,031,0002,113,536
4Sep 2, 2026 12:1420,535180,336,530169,202,0001,246,0002,113,536
5Sep 2, 2026 12:1420,696181,697,332170,749,0001,036,0002,113,536
6Sep 2, 2026 12:1421,273186,440,327175,521,0001,051,0002,113,536
7Sep 2, 2026 12:1422,264194,678,803183,752,0001,042,0002,113,536
8Sep 2, 2026 12:1422,278194,774,331183,866,0001,049,0002,113,536
9Sep 2, 2026 12:1422,512196,767,719185,793,0001,063,0002,113,536