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 listApr 7, 2026 20:32Danylo MocherniukDanylo MocherniukScore: 5,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 7, 2026 20:325,72570,786,28346,504,0001,010,0002,297,856
2Apr 7, 2026 20:325,73277,492,56745,550,0002,024,0002,424,832
3Apr 7, 2026 20:325,74778,086,12146,686,0001,014,0002,293,760
4Apr 7, 2026 20:325,76371,570,18045,840,0001,993,0002,297,856
5Apr 7, 2026 20:325,76969,973,28946,864,0001,018,0002,514,944
6Apr 7, 2026 20:325,79070,819,12846,055,0002,002,0002,285,568