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:43Josu San MartinJosu San MartinScore: 4,850Success
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:434,75353,383,96538,237,0001,220,0002,342,912
2May 9, 2026 20:434,79457,230,50438,492,0001,299,0002,351,104
3May 9, 2026 20:434,81755,561,76838,773,0001,210,0002,342,912
4May 9, 2026 20:434,81756,323,04138,804,0001,184,0002,355,200
5May 9, 2026 20:434,85057,643,26939,230,0001,027,0002,351,104
6May 9, 2026 20:434,85855,736,99139,141,0001,187,0002,355,200
7May 9, 2026 20:434,87356,951,32239,417,0001,035,0002,355,200
8May 9, 2026 20:434,94055,978,34539,789,0001,214,0002,355,200
9May 9, 2026 20:434,94662,494,93340,007,0001,045,0002,351,104