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 listFeb 19, 2026 21:05lipapipalipapipaScore: 5,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 21:055,75978,047,67345,810,0001,991,0002,514,944
2Feb 19, 2026 21:055,79769,596,20144,102,0004,009,0002,342,912
3Feb 19, 2026 21:055,80775,708,39046,190,0002,008,0002,523,136
4Feb 19, 2026 21:055,81473,049,49745,241,0003,016,0002,318,336
5Feb 19, 2026 21:055,82071,060,04745,285,0003,019,0002,363,392
6Feb 19, 2026 21:055,85778,900,27546,584,0002,025,0002,314,240