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, 2021 19:32Ilya AniskovetsIlya AniskovetsScore: 82,310Success
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, 2021 19:3277,609704,190,728644,155,43202,260,992
2Sep 1, 2021 19:3277,633705,021,246644,355,72302,277,376
3Sep 1, 2021 19:3277,648717,547,704644,475,87302,273,280
4Sep 1, 2021 19:3282,310751,235,887683,171,69602,269,184
5Sep 1, 2021 19:3282,322746,742,891683,272,17602,260,992
6Sep 1, 2021 19:3282,339745,098,273683,415,29202,273,280