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 listDec 29, 2022 20:27Alexander KimAlexander KimScore: 23,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2022 20:2723,587226,952,918193,775,0001,997,0002,326,528
2Dec 29, 2022 20:2723,587219,477,529194,777,000998,0002,326,528
3Dec 29, 2022 20:2723,607221,304,061193,942,0001,999,0002,326,528
4Dec 29, 2022 20:2723,610220,098,351192,964,0002,999,0002,285,568
5Dec 29, 2022 20:2723,626254,556,633196,092,44102,297,856
6Dec 29, 2022 20:2723,631253,610,087196,137,36402,281,472
7Dec 29, 2022 20:2723,635215,338,735194,166,0002,001,0002,461,696
8Dec 29, 2022 20:2723,636222,138,578192,173,0004,003,0002,326,528
9Dec 29, 2022 20:2723,641218,173,262193,217,0003,003,0002,469,888
10Dec 29, 2022 20:2723,658222,965,274194,361,0002,003,0002,326,528
11Dec 29, 2022 20:2723,660252,905,162196,376,16602,281,472
12Dec 29, 2022 20:2723,674225,663,981194,488,0002,005,0002,469,888