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 4, 2021 22:27Yuriy LyfenkoYuriy LyfenkoScore: 23,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2021 22:2723,607221,914,776193,936,0001,999,0002,260,992
2May 4, 2021 22:2723,611224,842,210193,973,0001,999,0002,383,872
3May 4, 2021 22:2723,618220,238,562194,033,0002,000,0002,260,992
4May 4, 2021 22:2723,619219,978,848194,041,0002,000,0002,260,992
5May 4, 2021 22:2723,624221,979,571195,076,0001,000,0002,260,992
6May 4, 2021 22:2723,624224,223,370195,080,0001,000,0002,396,160
7May 4, 2021 22:2723,631215,216,925196,137,00002,506,752
8May 4, 2021 22:2723,631221,419,924192,136,0004,002,0002,260,992
9May 4, 2021 22:2723,632227,639,551194,145,0002,001,0002,387,968