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 listFeb 11, 2026 18:30olliecrowolliecrowScore: 6,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:306,01374,489,82145,912,0003,992,0002,498,560
2Feb 11, 2026 18:306,01979,619,24446,963,0002,997,0002,473,984
3Feb 11, 2026 18:306,08875,100,58747,497,0003,031,0002,383,872
4Feb 11, 2026 18:306,36281,033,89247,820,0004,981,0002,473,984
5Feb 11, 2026 18:306,37382,998,91048,906,0003,992,0002,351,104
6Feb 11, 2026 18:306,42978,610,31450,344,0003,020,0002,367,488