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 09:12limanjun99limanjun99Score: 6,884Success
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 09:136,87573,662,03754,063,0003,003,0002,502,656stderr
2May 1, 2026 09:136,87776,835,89454,081,0003,004,0002,506,752stderr
3May 1, 2026 09:136,87974,169,45355,094,0002,003,0002,510,848stderr
4May 1, 2026 09:136,88271,957,95054,122,0003,006,0002,498,560stderr
5May 1, 2026 09:136,88475,444,43955,103,0002,040,0002,506,752stderr
6May 1, 2026 09:136,88575,811,34654,143,0003,007,0002,514,944stderr
7May 1, 2026 09:136,89674,874,25854,231,0003,012,0002,326,528stderr
8May 1, 2026 09:136,99476,991,48955,055,0003,003,0002,506,752stderr
9May 1, 2026 09:137,00477,836,50155,130,0003,007,0002,494,464stderr