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 listJul 15, 2022 16:55Yuriy LyfenkoYuriy LyfenkoScore: 11,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2022 16:5511,782369,717,33895,793,0001,995,0002,277,376
2Jul 15, 2022 16:5511,785370,660,51095,823,0001,996,0002,289,664
3Jul 15, 2022 16:5511,790374,189,87695,861,0001,997,0002,285,568
4Jul 15, 2022 16:5511,791369,106,16293,873,0003,994,0002,277,376
5Jul 15, 2022 16:5511,803371,732,28395,965,0001,999,0002,277,376
6Jul 15, 2022 16:5511,803373,839,11795,962,0001,999,0002,273,280
7Jul 15, 2022 16:5511,804372,516,33595,974,0001,999,0002,277,376
8Jul 15, 2022 16:5511,805371,868,68694,981,0002,999,0002,277,376
9Jul 15, 2022 16:5511,814369,402,27197,059,0001,000,0002,281,472
10Jul 15, 2022 16:5511,995411,924,35199,555,25802,289,664
11Jul 15, 2022 16:5511,998410,367,79799,585,22802,289,664
12Jul 15, 2022 16:5512,011412,043,64999,692,97902,293,760