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:25Josu San MartinJosu San MartinScore: 4,263Success
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:254,25450,456,31334,214,0001,096,0002,547,712
2May 10, 2026 04:254,25754,572,38534,211,0001,125,0002,555,904
3May 10, 2026 04:254,25950,153,74434,269,0001,085,0002,531,328
4May 10, 2026 04:254,26052,455,70934,251,0001,111,0002,555,904
5May 10, 2026 04:254,26352,008,77334,279,0001,111,0002,543,616
6May 10, 2026 04:254,26550,764,21234,299,0001,106,0002,560,000
7May 10, 2026 04:254,26950,889,82834,346,0001,091,0002,297,856
8May 10, 2026 04:254,28249,765,73034,369,0001,175,0002,547,712
9May 10, 2026 04:254,32951,134,40734,893,0001,042,0002,551,808