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 listMay 19, 2021 20:16Yuriy LyfenkoYuriy LyfenkoScore: 40,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 20:1640,248377,463,241334,058,01902,211,840
2May 19, 2021 20:5440,354400,239,390334,940,14302,211,840
3May 20, 2021 04:1340,367412,487,329335,048,76002,215,936
4May 19, 2021 20:5440,385406,966,345335,194,90502,211,840
5May 20, 2021 04:1340,388403,327,187335,216,43002,220,032
6May 19, 2021 20:5440,396416,361,077335,286,97302,211,840
7May 20, 2021 04:1340,402395,058,788335,338,17602,211,840
8May 19, 2021 20:1440,555391,761,570336,610,17002,236,416
9May 19, 2021 20:1440,561389,612,295336,655,42402,256,896
10May 19, 2021 20:1640,576365,123,368336,782,23302,232,320
11May 19, 2021 20:1640,581410,220,636336,822,92702,207,744
12May 19, 2021 20:1440,589421,711,013336,889,32702,306,048