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 16, 2021 18:38Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2021 18:3800000Died or killed
2May 16, 2021 18:3817,8553,845,002,620147,198,0001,001,0002,265,088
3May 16, 2021 18:3817,8561,527,324,298146,215,0001,989,0002,519,040
4May 16, 2021 18:3817,8592,584,826,842147,225,0001,001,0002,519,040
5May 16, 2021 18:3817,8645,065,685,257146,284,0001,990,0002,527,232
6May 16, 2021 18:3817,8732,121,888,727147,343,0001,002,0002,387,968
7May 16, 2021 18:3817,8751,555,588,394145,378,0002,987,0002,256,896
8May 16, 2021 18:3817,8795,099,699,689147,404,000995,0002,260,992
9May 16, 2021 18:3817,8802,197,742,188147,398,0001,002,0002,519,040
10May 16, 2021 18:3817,892730,208,368146,512,0001,993,0002,265,088