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, 2021 19:36Yuriy LyfenkoYuriy LyfenkoScore: 22,098Success
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, 2021 19:3621,935205,684,704181,060,0001,000,0002,396,160
2May 5, 2021 19:3622,000207,930,648179,611,0002,993,0002,260,992
3May 5, 2021 19:3622,001210,637,477181,607,0001,003,0002,396,160
4May 5, 2021 19:3622,026208,693,777179,819,0002,996,0002,387,968
5May 5, 2021 19:3622,098210,296,169180,406,0003,006,0002,260,992
6May 5, 2021 19:3622,170211,714,904182,010,0002,000,0002,260,992
7May 5, 2021 19:3622,190211,361,998182,174,0002,001,0002,392,064
8May 5, 2021 19:3622,194214,240,312183,206,0001,001,0002,260,992
9May 5, 2021 19:3622,211205,565,423184,349,00002,260,992