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 21, 2021 12:27Dmitry DolgopolovDmitry DolgopolovScore: 28,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2021 12:2728,658304,683,844237,859,47202,289,664
2May 21, 2021 12:2728,662304,268,006237,894,65102,281,472
3May 21, 2021 12:2728,670299,713,663237,957,22202,289,664
4May 21, 2021 12:2728,967264,642,677238,426,0002,003,0002,514,944
5May 21, 2021 12:2728,976267,902,384238,494,0002,004,0002,289,664
6May 21, 2021 12:2728,978267,689,403238,512,0002,004,0002,281,472
7May 21, 2021 12:2728,984266,865,356239,563,0001,002,0002,506,752
8May 21, 2021 12:2728,994263,485,945237,655,0002,995,0002,506,752
9May 21, 2021 12:2729,002262,978,691238,714,0002,006,0002,281,472
10May 21, 2021 12:2729,003266,608,968237,733,0002,996,0002,347,008
11May 21, 2021 12:2729,005270,003,270237,747,0002,996,0002,289,664
12May 21, 2021 12:2729,009264,219,546237,780,0002,997,0002,289,664