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 7, 2021 18:40Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2021 18:4000000Died or killed
2May 7, 2021 18:4019,393185,665,496158,962,0001,999,0002,260,992
3May 7, 2021 18:4019,395186,755,601158,977,0001,999,0002,260,992
4May 7, 2021 18:4019,396189,416,085157,985,0002,999,0002,523,136
5May 7, 2021 18:4019,399186,075,666159,012,0002,000,0002,506,752
6May 7, 2021 18:4019,406186,022,758160,072,0001,000,0002,260,992
7May 7, 2021 18:4019,416192,120,855158,147,0003,002,0002,260,992
8May 7, 2021 18:4019,421189,715,749159,196,0002,002,0002,260,992
9May 7, 2021 18:4019,421190,159,680160,196,0001,001,0002,523,136
10May 7, 2021 18:4019,576187,191,960162,477,00002,506,752