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 listAug 18, 2025 13:08Ashish AhujaAshish AhujaScore: 11,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 13:0811,103119,489,53986,144,0006,010,0002,277,376
2Aug 18, 2025 13:0811,147121,470,00486,548,0005,968,0002,404,352
3Aug 18, 2025 13:0811,160124,797,90285,659,0006,972,0002,367,488
4Aug 18, 2025 13:0811,197119,564,21885,944,0006,995,0002,527,232
5Aug 18, 2025 13:0811,304114,667,29386,836,0006,986,0002,277,376
6Aug 18, 2025 13:0811,527119,912,30787,704,0007,973,0002,318,336