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 5, 2026 21:38cashkarucashkaruScore: 55,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 21:3855,330477,330,957457,236,0002,008,0002,514,944
2May 5, 2026 21:3855,653479,440,289459,911,0002,014,0002,502,656
3May 5, 2026 21:3855,665480,052,677461,022,0001,004,0002,502,656
4May 5, 2026 21:3855,674480,775,477461,092,0001,006,0002,506,752
5May 5, 2026 21:3855,677478,309,021460,097,0002,029,0002,502,656
6May 5, 2026 21:3855,684481,263,617460,175,0002,005,0002,506,752
7May 5, 2026 21:3855,690480,185,303460,188,0002,045,0002,514,944
8May 5, 2026 21:3855,690480,304,629460,172,0002,061,0002,506,752
9May 5, 2026 21:3855,692478,449,923460,220,0002,031,0002,514,944