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 4, 2026 23:58olliecrowolliecrowScore: 5,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 00:045,74571,561,27145,621,0002,063,0002,543,616
2May 5, 2026 00:045,82771,379,20646,231,0002,139,0002,342,912
3May 5, 2026 00:045,85955,541,49146,473,0002,159,0002,375,680
4May 5, 2026 00:045,85955,478,39546,471,0002,159,0002,560,000
5May 5, 2026 00:045,86655,234,05546,450,0002,239,0002,371,584
6May 5, 2026 00:045,95979,940,51447,256,0002,206,0002,547,712
7May 5, 2026 00:045,98060,581,90847,398,0002,243,0002,347,008
8May 5, 2026 00:046,00656,961,90747,652,0002,201,0002,543,616
9May 5, 2026 00:046,05756,533,77748,074,0002,202,0002,514,944