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 listSep 7, 2021 11:35Egor GabovEgor GabovScore: 1,633,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2021 11:351,632,72213,608,948,95613,551,589,76902,252,800
2Sep 7, 2021 11:351,633,75313,618,277,30113,560,153,00702,265,088
3Sep 7, 2021 11:351,635,86513,628,844,43613,577,681,40502,260,992