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 listMay 1, 2026 10:50limanjun99limanjun99Score: 6,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 10:516,69774,685,97753,572,0002,021,0002,519,040
2May 1, 2026 10:516,71673,432,29852,760,0002,986,0002,510,848
3May 1, 2026 10:516,72676,214,17752,842,0002,991,0002,506,752
4May 1, 2026 10:516,72777,851,66953,846,0001,994,0002,510,848
5May 1, 2026 10:516,72972,265,13752,863,0002,992,0002,514,944
6May 1, 2026 10:516,73274,874,10551,885,0003,991,0002,510,848
7May 1, 2026 10:516,80579,036,99055,474,0001,008,0002,514,944
8May 1, 2026 10:516,80677,832,23254,479,0002,017,0002,506,752
9May 1, 2026 10:516,80876,290,68054,495,0002,018,0002,510,848