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 13, 2022 03:02Yuriy LyfenkoYuriy LyfenkoScore: 7,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2022 03:027,14482,445,39354,271,0005,025,0002,351,104
2Sep 13, 2022 03:027,16285,934,44255,414,0004,030,0002,428,928
3Sep 13, 2022 03:027,17287,384,89456,499,0003,026,0002,347,008
4Sep 13, 2022 03:027,23188,054,99856,015,0004,001,0002,514,944
5Sep 13, 2022 03:027,24784,719,64656,144,0004,010,0002,494,464
6Sep 13, 2022 03:027,252125,290,25860,190,14302,265,088
7Sep 13, 2022 03:027,25986,940,22457,240,0003,012,0002,314,240
8Sep 13, 2022 03:027,26088,014,82057,244,0003,012,0002,437,120
9Sep 13, 2022 03:027,304121,962,58160,626,74302,232,320
10Sep 13, 2022 03:027,32485,593,67256,803,0003,986,0002,281,472
11Sep 13, 2022 03:027,339121,793,51460,911,70702,195,456
12Sep 13, 2022 03:027,52182,674,72660,415,0002,013,0002,265,088