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 20, 2021 20:19Dmitry DolgopolovDmitry DolgopolovScore: 29,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2021 20:1928,677305,047,744238,020,91902,293,760
2May 20, 2021 20:1928,685315,742,530238,082,92902,281,472
3May 20, 2021 20:1928,761299,340,326238,713,35302,285,568
4May 20, 2021 20:1928,969263,713,817238,443,0002,003,0002,424,832
5May 20, 2021 20:1928,973268,799,837237,469,0003,005,0002,506,752
6May 20, 2021 20:1928,980265,265,292238,526,0002,004,0002,289,664
7May 20, 2021 20:1929,000271,126,182237,700,0002,996,0002,502,656
8May 20, 2021 20:1929,001269,077,437237,712,0002,996,0002,289,664
9May 20, 2021 20:1929,003265,890,817237,725,0002,996,0002,289,664
10May 20, 2021 20:1929,003268,707,484237,729,0002,996,0002,289,664
11May 20, 2021 20:1929,004267,427,585237,737,0002,996,0002,502,656
12May 20, 2021 20:1929,004267,329,811237,739,0002,996,0002,289,664