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 listApr 26, 2023 10:12Gilson UrbanoGilson UrbanoScore: 1,642,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2023 10:121,641,72213,698,188,62113,626,296,28702,265,088
2Apr 26, 2023 10:121,642,03213,702,320,22713,628,863,19402,265,088
3Apr 26, 2023 10:121,644,10113,711,423,58913,646,037,52302,252,800