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 listSep 19, 2022 01:22Yuriy LyfenkoYuriy LyfenkoScore: 10,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2022 01:2210,476114,528,64780,954,0005,996,0002,523,136
2Sep 19, 2022 01:2210,483149,400,59487,010,28402,252,800
3Sep 19, 2022 01:2210,541113,442,88483,471,0004,022,0002,396,160
4Sep 19, 2022 01:2210,558172,810,38887,629,61702,260,992
5Sep 19, 2022 01:2210,582117,756,79483,842,0003,992,0002,510,848
6Sep 19, 2022 01:2210,590114,360,82981,905,0005,993,0002,281,472
7Sep 19, 2022 01:2210,593110,567,05182,924,0004,995,0002,453,504
8Sep 19, 2022 01:2210,668116,855,45181,498,0007,043,0002,416,640
9Sep 19, 2022 01:2210,749114,243,10783,205,0006,014,0002,338,816
10Sep 19, 2022 01:2210,791116,684,92185,539,0004,025,0002,457,600
11Sep 19, 2022 01:2210,816157,363,01289,772,46202,211,840
12Sep 19, 2022 01:2210,874114,649,94285,243,0005,014,0002,342,912