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 1, 2026 09:49limanjun99limanjun99Score: 7,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 09:507,30576,082,83858,611,0002,021,0002,514,944
2May 1, 2026 09:507,31679,077,93057,739,0002,986,0002,510,848
3May 1, 2026 09:507,32477,992,10357,807,0002,990,0002,510,848
4May 1, 2026 09:507,32877,996,64857,838,0002,991,0002,506,752
5May 1, 2026 09:507,33083,295,96557,851,0002,992,0002,523,136
6May 1, 2026 09:507,33579,662,98157,893,0002,994,0002,494,464
7May 1, 2026 09:507,33878,061,08757,912,0002,995,0002,514,944
8May 1, 2026 09:507,41081,388,83759,494,0002,016,0002,514,944
9May 1, 2026 09:507,43979,480,25958,757,0002,987,0002,506,752