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 24, 2024 09:20Ilango RajagopalIlango RajagopalScore: 155,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2024 09:20155,8401,322,540,8251,106,552,000186,924,0002,265,088
2Sep 24, 2024 09:20155,8611,326,292,9541,105,699,000187,948,0002,469,888
3Sep 24, 2024 09:20156,4171,329,751,5491,106,373,000191,891,0002,387,968