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:02Yuriy LyfenkoYuriy LyfenkoScore: 18,150Success
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:0218,1171,532,565,794149,362,0001,009,0002,265,088
2May 19, 2021 20:0218,1262,582,161,433148,454,0001,992,0002,387,968
3May 19, 2021 20:0218,128420,500,796150,460,00002,396,160
4May 19, 2021 20:0218,1302,478,200,193148,473,0002,006,0002,260,992
5May 19, 2021 20:0218,132197,686,812149,496,000996,0002,523,136
6May 19, 2021 20:0218,1422,202,736,503149,578,000997,0002,392,064
7May 19, 2021 20:0218,1503,157,176,435148,648,0001,995,0002,383,872
8May 19, 2021 20:0218,1641,537,769,108146,771,0003,993,0002,260,992
9May 19, 2021 20:0218,2542,063,040,425149,515,0001,993,0002,256,896
10May 19, 2021 20:0218,3923,063,866,943152,652,01102,273,280
11May 19, 2021 20:0218,4091,315,737,726152,797,61002,269,184
12May 19, 2021 20:0218,415565,609,743152,840,86402,273,280