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:21Josu San MartinJosu San MartinScore: 4,933Success
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:224,80355,229,99838,841,0001,029,0002,347,008
2May 9, 2026 20:224,83659,334,31039,085,0001,055,0002,347,008
3May 9, 2026 20:224,88554,929,16139,522,0001,027,0002,347,008
4May 9, 2026 20:224,92458,288,25339,848,0001,029,0002,347,008
5May 9, 2026 20:224,93359,505,33839,912,0001,035,0002,355,200
6May 9, 2026 20:224,95355,387,53239,828,0001,290,0002,351,104
7May 9, 2026 20:225,03959,158,76840,802,0001,027,0002,359,296
8May 9, 2026 20:225,20662,885,02542,182,0001,033,0002,347,008
9May 9, 2026 20:228,36784,936,43168,422,0001,025,0002,338,816