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 17, 2022 01:39Yuriy LyfenkoYuriy LyfenkoScore: 29,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 01:3929,288312,883,663243,088,68002,215,936
2Jan 17, 2022 01:3929,289263,736,801241,102,0002,000,0002,523,136
3Jan 17, 2022 01:3929,290266,591,881241,108,0002,000,0002,326,528
4Jan 17, 2022 01:3929,290264,511,031241,111,0002,000,0002,383,872
5Jan 17, 2022 01:3929,292273,864,877240,125,0003,001,0002,326,528
6Jan 17, 2022 01:3929,295312,981,451243,151,14902,215,936
7Jan 17, 2022 01:3929,301304,770,341243,195,16102,220,032
8Jan 17, 2022 01:3929,306268,403,597241,240,0002,001,0002,527,232
9Jan 17, 2022 01:3929,325268,200,071242,400,0001,001,0002,326,528
10Jan 17, 2022 01:3929,328268,286,584242,419,0001,001,0002,326,528
11Jan 17, 2022 01:3929,332268,732,250241,453,0002,003,0002,326,528
12Jan 17, 2022 01:3929,335274,310,251241,481,0002,003,0002,523,136