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:04Yuriy LyfenkoYuriy LyfenkoScore: 17,550Success
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:0417,5252,837,478,482144,451,0001,003,0002,265,088
2May 19, 2021 20:0417,5291,318,101,856144,490,0001,003,0002,396,160
3May 19, 2021 20:0417,5332,772,081,482142,535,0002,990,0002,260,992
4May 19, 2021 20:0417,5381,057,095,739144,565,000997,0002,523,136
5May 19, 2021 20:0417,539884,077,266144,577,000997,0002,256,896
6May 19, 2021 20:0417,5451,197,165,254143,630,0001,994,0002,510,848
7May 19, 2021 20:0417,5501,448,130,046145,664,00002,265,088
8May 19, 2021 20:0417,5502,053,741,030143,666,0001,995,0002,523,136
9May 19, 2021 20:0417,5672,027,362,241144,804,000998,0002,519,040
10May 19, 2021 20:0418,0092,483,611,771149,477,00702,265,088
11May 19, 2021 20:0418,017829,923,630149,542,16802,428,928
12May 19, 2021 20:0418,0221,286,002,421149,581,07102,269,184