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 16, 2026 03:28Victor MerckléVictor MerckléScore: 7,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 03:287,11666,402,76559,071,00002,113,536
2May 16, 2026 03:287,11766,347,27759,079,00002,113,536
3May 16, 2026 03:287,11869,220,50758,085,0001,002,0002,113,536
4May 16, 2026 03:287,12167,356,69658,095,0001,016,0002,113,536
5May 16, 2026 03:287,12166,560,72658,105,0001,000,0002,113,536
6May 16, 2026 03:287,12166,556,77258,065,0001,042,0002,113,536
7May 16, 2026 03:287,12868,535,47158,143,0001,020,0002,113,536
8May 16, 2026 03:287,18867,370,99358,645,0001,019,0002,113,536
9May 16, 2026 03:287,26769,375,27959,313,0001,007,0002,113,536