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 18, 2026 07:42Victor MerckléVictor MerckléScore: 7,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 07:507,15667,691,54558,344,0001,055,0002,113,536
2May 18, 2026 07:507,15870,171,20758,348,0001,070,0002,113,536
3May 18, 2026 07:507,15969,347,68758,369,0001,055,0002,113,536
4May 18, 2026 07:507,16067,360,86458,388,0001,046,0002,113,536
5May 18, 2026 07:507,16269,308,99258,402,0001,050,0002,113,536
6May 18, 2026 07:507,16369,484,06658,399,0001,058,0002,113,536
7May 18, 2026 07:507,16769,616,58458,440,0001,053,0002,113,536
8May 18, 2026 07:507,21070,325,10558,784,0001,060,0002,113,536
9May 18, 2026 07:507,22869,708,58758,937,0001,063,0002,113,536