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 31, 2024 05:02GraceGraceScore: 9,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2024 05:029,083148,658,30075,385,53502,293,760
2May 31, 2024 05:029,219132,197,92776,515,26602,285,568
3May 31, 2024 05:029,266138,778,25176,910,18002,293,760
4May 31, 2024 05:039,420136,566,74978,186,64002,301,952
5May 31, 2024 05:029,518143,429,15278,998,43502,179,072
6May 31, 2024 05:029,541154,864,71079,190,15702,297,856
7May 31, 2024 05:039,566146,068,24079,397,08502,293,760
8May 31, 2024 05:029,710142,292,62480,591,78302,301,952
9May 31, 2024 05:0310,006167,509,58583,046,19902,293,760
10May 31, 2024 05:0210,011150,159,86683,092,31602,306,048
11May 31, 2024 05:0210,035145,346,68783,294,28902,289,664
12May 31, 2024 05:0210,119142,648,03283,986,58702,301,952