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 07:18wnwnScore: 3,506Success
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 07:203,32737,271,22227,616,00002,113,536
2May 11, 2026 07:203,35437,284,06526,820,0001,025,0002,113,536
3May 11, 2026 07:203,49038,179,55328,967,00002,113,536
4May 11, 2026 07:203,49638,639,70029,022,00002,113,536
5May 11, 2026 07:203,50636,591,46428,098,0001,006,0002,113,536
6May 11, 2026 07:203,50939,644,19929,130,00002,113,536
7May 11, 2026 07:203,51136,943,45928,136,0001,007,0002,113,536
8May 11, 2026 07:203,51537,686,21728,095,0001,086,0002,113,536
9May 11, 2026 07:203,52437,502,07328,244,0001,007,0002,113,536