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 19, 2021 20:02Yuriy LyfenkoYuriy LyfenkoScore: 18,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 20:0218,025283,501,609148,614,000997,0002,510,848
2May 19, 2021 20:0218,036473,432,871148,694,0001,004,0002,527,232
3May 19, 2021 20:0218,0432,001,210,733147,762,0001,996,0002,256,896
4May 19, 2021 20:0218,0442,766,240,209148,771,000998,0002,519,040
5May 19, 2021 20:0218,0502,616,663,275149,816,00002,260,992
6May 19, 2021 20:0218,0541,248,651,981146,849,0002,996,0002,260,992
7May 19, 2021 20:0218,0572,888,534,531147,878,0001,998,0002,519,040
8May 19, 2021 20:0218,069461,845,251148,983,000993,0002,400,256
9May 19, 2021 20:0218,0782,025,818,022148,059,0001,987,0002,256,896
10May 19, 2021 20:0218,4561,981,787,900153,181,70502,269,184
11May 19, 2021 20:0218,4751,477,949,828153,340,35302,273,280
12May 19, 2021 20:0218,4952,232,877,292153,507,87002,269,184