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 20, 2026 05:32M-RochatM-RochatScore: 13,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:3213,590125,069,342109,528,0003,276,0002,113,536
2May 20, 2026 05:3213,597123,945,481109,569,0003,289,0002,113,536
3May 20, 2026 05:3213,606122,441,530109,660,0003,273,0002,113,536
4May 20, 2026 05:3213,677126,039,677110,097,0003,425,0002,113,536
5May 20, 2026 05:3213,758124,251,722110,737,0003,458,0002,113,536
6May 20, 2026 05:3213,763123,682,701110,818,0003,415,0002,113,536
7May 20, 2026 05:3213,770124,874,443111,014,0003,285,0002,113,536
8May 20, 2026 05:3213,786123,858,544110,984,0003,442,0002,113,536
9May 20, 2026 05:3213,805127,080,849111,117,0003,470,0002,113,536