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 7, 2026 19:07neel-bhavsarneel-bhavsarScore: 93,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 19:0893,366785,636,418695,347,00079,597,00020,480
2Sep 7, 2026 19:0893,382785,818,976695,750,00079,328,00020,480
3Sep 7, 2026 19:0893,439786,105,048696,586,00078,963,00020,480
4Sep 7, 2026 19:0893,441786,251,165696,589,00078,979,00020,480
5Sep 7, 2026 19:0893,462786,886,785697,070,00078,666,0002,113,536
6Sep 7, 2026 19:0893,497786,667,881696,836,00079,192,00020,480
7Sep 7, 2026 19:0893,542787,148,133697,618,00078,788,00020,480
8Sep 7, 2026 19:0893,552786,500,052697,040,00079,445,00020,480
9Sep 7, 2026 19:0893,580786,644,074696,816,00079,898,00020,480