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:14Yuriy LyfenkoYuriy LyfenkoScore: 17,863Success
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:1417,8471,900,908,161145,148,0002,982,0002,523,136
2May 17, 2021 20:1417,859881,160,958146,243,0001,989,0002,519,040
3May 17, 2021 20:1417,8602,357,050,782147,241,000994,0002,519,040
4May 17, 2021 20:1417,862493,328,736145,268,0002,984,0002,265,088
5May 17, 2021 20:1417,863724,453,620147,261,0001,001,0002,519,040
6May 17, 2021 20:1417,8681,714,335,543146,302,0002,004,0002,265,088
7May 17, 2021 20:1417,885257,697,321146,456,0001,992,0002,260,992
8May 17, 2021 20:1417,8861,867,256,910145,464,0002,989,0002,256,896
9May 17, 2021 20:1417,8892,288,211,817147,483,000996,0002,396,160