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 1, 2022 13:45Bernard TeoBernard TeoScore: 1,641,915Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2022 13:451,641,52413,679,594,39113,624,651,86002,256,896
2Sep 1, 2022 13:451,641,91513,694,245,87413,627,891,62202,252,800
3Sep 1, 2022 13:451,642,78613,696,295,56313,635,125,57902,256,896