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 listFeb 17, 2023 18:27Nikita GalushkoNikita GalushkoScore: 2,316,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2023 18:272,302,37419,166,252,29019,109,703,28402,220,032
2Feb 17, 2023 18:272,316,89919,291,078,96219,230,260,21202,220,032
3Feb 17, 2023 18:272,330,43919,418,815,46219,342,647,31902,224,128