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 9, 2026 20:33Josu San MartinJosu San MartinScore: 5,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 20:335,01059,679,86140,550,0001,041,0002,347,008
2May 9, 2026 20:335,02159,807,68440,636,0001,039,0002,334,720
3May 9, 2026 20:335,03458,378,28040,744,0001,039,0002,355,200
4May 9, 2026 20:335,05958,178,24940,950,0001,047,0002,334,720
5May 9, 2026 20:335,13856,790,97541,607,0001,045,0002,338,816
6May 9, 2026 20:335,14657,858,09841,662,0001,057,0002,351,104
7May 9, 2026 20:335,19958,154,14042,101,0001,053,0002,342,912
8May 9, 2026 20:335,21761,780,21142,268,0001,037,0002,351,104
9May 9, 2026 20:335,32760,434,50143,187,0001,035,0002,355,200