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 22, 2021 15:43Yuriy LyfenkoYuriy LyfenkoScore: 17,320Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 15:4317,214167,229,469140,875,0001,998,0002,269,184
2May 22, 2021 15:4317,216172,811,668140,896,0001,998,0002,260,992
3May 22, 2021 15:4317,220172,937,520140,930,0001,999,0002,387,968
4May 22, 2021 15:4317,222172,441,866140,944,0001,999,0002,383,872
5May 22, 2021 15:4317,230173,679,749142,013,0001,000,0002,383,872
6May 22, 2021 15:4317,247168,825,090141,144,0002,002,0002,260,992
7May 22, 2021 15:4317,320168,222,050141,764,0001,996,0002,387,968
8May 22, 2021 15:4317,324172,161,710141,791,0001,997,0002,260,992
9May 22, 2021 15:4317,479177,653,960144,074,0001,000,0002,392,064
10May 22, 2021 15:4317,879209,284,733148,399,59502,256,896
11May 22, 2021 15:4317,879213,843,231148,397,78402,265,088
12May 22, 2021 15:4317,886210,207,868148,449,81002,265,088