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 21:54Josu San MartinJosu San MartinScore: 4,988Success
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 21:544,94957,063,55540,055,0001,027,0002,514,944
2May 9, 2026 21:544,96557,486,12640,189,0001,027,0002,519,040
3May 9, 2026 21:544,97659,328,09740,281,0001,026,0002,514,944
4May 9, 2026 21:544,98055,813,24340,311,0001,027,0002,510,848
5May 9, 2026 21:544,98858,007,81440,373,0001,035,0002,514,944
6May 9, 2026 21:545,04659,131,24040,843,0001,047,0002,502,656
7May 9, 2026 21:545,06159,428,28740,978,0001,035,0002,523,136
8May 9, 2026 21:545,26859,417,24342,694,0001,032,0002,506,752
9May 9, 2026 21:545,32859,343,85043,198,0001,025,0002,506,752