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:03Yuriy LyfenkoYuriy LyfenkoScore: 17,521Success
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:0317,4951,541,215,282145,205,00002,265,088
2May 19, 2021 20:0317,5033,090,405,693141,296,0003,980,0002,260,992
3May 19, 2021 20:0317,5061,337,201,949144,297,0001,002,0002,260,992
4May 19, 2021 20:0317,5082,554,228,458145,315,00002,519,040
5May 19, 2021 20:0317,514767,651,118144,368,000995,0002,527,232
6May 19, 2021 20:0317,5151,769,561,401142,391,0002,987,0002,519,040
7May 19, 2021 20:0317,521774,297,613143,417,0002,005,0002,260,992
8May 19, 2021 20:0317,5512,162,730,526144,679,000997,0002,256,896
9May 19, 2021 20:0317,565416,003,898145,787,00002,523,136
10May 19, 2021 20:0317,972938,286,526149,167,80402,260,992
11May 19, 2021 20:0317,9911,136,831,957149,323,08002,269,184
12May 19, 2021 20:0318,0011,525,157,836149,404,60402,269,184