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 11, 2026 18:09Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:10041,634,53231,288,0001,102,0002,113,536expected "53690238525412661 ", got "53690238269412661 "
2May 11, 2026 18:103,86939,404,32431,029,0001,090,0002,113,536
3May 11, 2026 18:103,87240,136,36231,066,0001,079,0002,113,536
4May 11, 2026 18:103,87541,254,21531,089,0001,074,0002,113,536
5May 11, 2026 18:103,87842,526,47531,108,0001,083,0002,113,536
6May 11, 2026 18:103,87940,484,31031,111,0001,089,0002,113,536
7May 11, 2026 18:103,88047,603,42031,088,0001,119,0002,113,536
8May 11, 2026 18:103,89041,565,40531,188,0001,105,0002,113,536
9May 11, 2026 18:103,89841,629,70331,300,0001,058,0002,113,536