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 5, 2026 00:21olliecrowolliecrowScore: 5,940Success
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:345,88555,177,23046,765,0002,082,0002,387,968
2May 5, 2026 00:345,91157,610,12646,974,0002,090,0002,338,816
3May 5, 2026 00:345,93255,529,57947,044,0002,198,0002,392,064
4May 5, 2026 00:345,94055,773,82647,173,0002,134,0002,367,488
5May 5, 2026 00:345,94055,676,31547,128,0002,180,0002,342,912
6May 5, 2026 00:345,94355,803,17047,087,0002,241,0002,301,952
7May 5, 2026 00:345,95355,853,77747,254,0002,161,0002,428,928
8May 5, 2026 00:345,98756,299,44847,570,0002,129,0002,555,904
9May 5, 2026 00:346,15480,178,22948,918,0002,165,0002,375,680