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 listJan 10, 2022 04:19Yuriy LyfenkoYuriy LyfenkoScore: 14,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2022 04:1914,784402,497,150121,710,000997,0002,285,568
2Jan 10, 2022 04:1914,786397,721,345120,729,0001,995,0002,281,472
3Jan 10, 2022 04:1914,793394,358,503120,789,0001,996,0002,277,376
4Jan 10, 2022 04:1914,797396,256,193120,822,0001,997,0002,285,568
5Jan 10, 2022 04:1914,797398,321,223120,819,0001,997,0002,285,568
6Jan 10, 2022 04:1914,802396,629,761121,855,000998,0002,273,280
7Jan 10, 2022 04:1914,805395,964,418120,884,0001,998,0002,285,568
8Jan 10, 2022 04:1914,807398,829,853120,899,0001,998,0002,285,568
9Jan 10, 2022 04:1914,810396,913,887120,924,0001,998,0002,277,376
10Jan 10, 2022 04:1915,469434,547,468128,389,18002,281,472
11Jan 10, 2022 04:1915,470440,486,827128,397,59502,273,280
12Jan 10, 2022 04:1915,493435,150,211128,594,36702,277,376