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 5, 2021 21:53Yuriy LyfenkoYuriy LyfenkoScore: 19,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 21:5319,348186,189,445160,589,00002,260,992
2May 5, 2021 21:5319,355192,053,189159,651,000997,0002,260,992
3May 5, 2021 21:5319,367187,422,772158,751,0001,996,0002,392,064
4May 5, 2021 21:5319,368186,793,844158,761,0001,996,0002,260,992
5May 5, 2021 21:5319,368190,210,108157,763,0002,995,0002,510,848
6May 5, 2021 21:5319,373186,538,832158,795,0001,997,0002,392,064
7May 5, 2021 21:5319,380186,872,621158,858,0001,998,0002,260,992
8May 5, 2021 21:5319,384193,385,477159,891,000999,0002,392,064
9May 5, 2021 21:5319,388192,175,657158,925,0001,999,0002,260,992