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 listJul 2, 2023 22:38sliceteamsliceteamScore: 34,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2023 22:3834,937359,561,694289,977,25902,265,088
2Jul 2, 2023 22:3934,944351,191,568290,031,79702,265,088
3Jul 2, 2023 22:3934,947356,536,524290,062,33202,240,512
4Jul 2, 2023 22:3934,948361,395,083290,071,59502,260,992
5Jul 2, 2023 22:3834,949358,687,649290,072,88602,265,088
6Jul 2, 2023 22:3834,979378,559,295290,323,73602,265,088