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 17, 2021 20:17Yuriy LyfenkoYuriy LyfenkoScore: 17,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 20:1717,7931,226,212,374146,689,000997,0002,260,992
2May 17, 2021 20:1717,7931,828,051,324145,687,0001,995,0002,260,992
3May 17, 2021 20:1717,8043,002,010,164145,774,0001,996,0002,523,136
4May 17, 2021 20:1717,8142,648,629,874146,861,000992,0002,523,136
5May 17, 2021 20:1717,8142,995,539,440147,853,00002,260,992
6May 17, 2021 20:1717,8181,780,231,712143,922,0003,970,0002,265,088
7May 17, 2021 20:1717,8201,547,494,965146,910,000999,0002,260,992
8May 17, 2021 20:1717,8231,293,814,725146,933,000999,0002,256,896
9May 17, 2021 20:1717,8292,623,034,460145,996,0001,986,0002,523,136