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:30Yuriy LyfenkoYuriy LyfenkoScore: 23,783Success
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:3023,758218,554,319196,190,0001,000,0002,260,992
2May 4, 2021 22:3023,759223,647,849196,200,0001,001,0002,260,992
3May 4, 2021 22:3023,760224,714,890194,207,0003,003,0002,396,160
4May 4, 2021 22:3023,774225,033,330195,321,0002,003,0002,256,896
5May 4, 2021 22:3023,783219,621,510195,399,0002,004,0002,387,968
6May 4, 2021 22:3023,796219,283,615197,504,00002,392,064
7May 4, 2021 22:3023,798224,275,384196,524,0001,002,0002,260,992
8May 4, 2021 22:3023,806223,517,643195,591,0001,995,0002,260,992
9May 4, 2021 22:3023,809229,325,707197,617,00002,260,992