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 listOct 15, 2026 19:08timothygktimothygkScore: 44,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 19:0944,100377,924,406361,976,0004,055,00024,576stderr
2Oct 15, 2026 19:0944,106376,641,363362,080,0004,003,00024,576stderr
3Oct 15, 2026 19:0944,112376,634,932362,272,0003,865,00024,576stderr
4Oct 15, 2026 19:0944,117376,544,161361,875,0004,298,00024,576stderr
5Oct 15, 2026 19:0944,132376,833,041362,184,0004,117,0002,117,632stderr
6Oct 15, 2026 19:0944,177377,161,191362,388,0004,286,00024,576stderr
7Oct 15, 2026 19:0944,186377,293,297362,721,0004,028,00024,576stderr
8Oct 15, 2026 19:0944,306378,140,944363,792,0003,948,00024,576stderr
9Oct 15, 2026 19:0945,637389,297,866375,121,0003,673,00024,576stderr