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 01:43Josu 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 01:43042,589,72931,588,0001,038,0002,113,536expected "53689400882340845 ", got "53689400626340845 "
2May 11, 2026 01:433,92641,989,27331,537,0001,057,0002,113,536
3May 11, 2026 01:433,93442,024,78531,614,0001,046,0002,113,536
4May 11, 2026 01:433,94340,577,86531,692,0001,043,0002,113,536
5May 11, 2026 01:433,94941,707,49431,726,0001,052,0002,113,536
6May 11, 2026 01:433,95143,609,33531,741,0001,054,0002,113,536
7May 11, 2026 01:434,00143,218,22532,131,0001,078,0002,113,536
8May 11, 2026 01:434,02142,189,77432,309,0001,070,0002,113,536
9May 11, 2026 01:434,09043,637,77132,908,0001,046,0002,113,536