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 12, 2022 04:04Yuriy LyfenkoYuriy LyfenkoScore: 7,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2022 04:047,10483,624,55256,969,0001,998,0002,502,656
2Sep 12, 2022 04:047,13186,497,10356,178,0003,009,0002,519,040
3Sep 12, 2022 04:047,13680,369,78956,216,0003,011,0002,441,216
4Sep 12, 2022 04:047,15785,158,77656,381,0003,020,0002,285,568
5Sep 12, 2022 04:047,15884,702,82955,381,0004,027,0002,408,448
6Sep 12, 2022 04:047,16584,271,70856,443,0003,023,0002,473,984
7Sep 12, 2022 04:047,17690,417,63855,522,0004,038,0002,355,200
8Sep 12, 2022 04:047,22885,496,29556,990,0002,999,0002,289,664
9Sep 12, 2022 04:047,266138,694,91060,310,57502,215,936
10Sep 12, 2022 04:047,34082,315,15857,923,0002,996,0002,301,952
11Sep 12, 2022 04:047,381123,360,50461,258,95902,195,456
12Sep 12, 2022 04:047,408120,498,47661,486,48702,199,552