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 10, 2026 04:46Josu San MartinJosu San MartinScore: 4,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 04:474,44254,374,17635,715,0001,156,0002,547,712
2May 10, 2026 04:474,46353,541,36136,005,0001,044,0002,547,712
3May 10, 2026 04:474,46452,108,95235,900,0001,158,0002,560,000
4May 10, 2026 04:474,47653,478,40336,127,0001,031,0002,551,808
5May 10, 2026 04:474,47854,581,20036,071,0001,101,0002,551,808
6May 10, 2026 04:474,48353,818,31036,184,0001,033,0002,555,904
7May 10, 2026 04:474,48454,077,33236,184,0001,036,0002,555,904
8May 10, 2026 04:474,49153,794,34236,240,0001,041,0002,551,808
9May 10, 2026 04:474,50555,754,25536,345,0001,053,0002,543,616