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 listMay 11, 2026 02:06Josu San MartinJosu San MartinScore: 3,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 02:063,87441,614,82431,071,0001,091,0002,113,536
2May 11, 2026 02:063,87840,523,58431,019,0001,169,0002,113,536
3May 11, 2026 02:063,88240,984,89431,144,0001,080,0002,113,536
4May 11, 2026 02:063,88840,199,57431,187,0001,088,0002,113,536
5May 11, 2026 02:063,89540,489,01231,239,0001,096,0002,113,536
6May 11, 2026 02:063,90141,891,67931,318,0001,068,0002,113,536
7May 11, 2026 02:063,91040,169,21031,365,0001,091,0002,113,536
8May 11, 2026 02:063,93741,334,89031,579,0001,099,0002,113,536
9May 11, 2026 02:063,96240,766,33531,797,0001,094,0002,113,536