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 10, 2026 18:35Josu San MartinJosu San MartinScore: 3,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 18:353,93142,149,67331,624,0001,005,0002,113,536
2May 10, 2026 18:353,93740,369,30331,574,0001,111,0002,113,536
3May 10, 2026 18:353,94340,830,51731,637,0001,094,0002,113,536
4May 10, 2026 18:353,95641,991,31631,774,0001,069,0002,113,536
5May 10, 2026 18:353,96540,179,70631,846,0001,071,0002,113,536
6May 10, 2026 18:353,97541,675,05931,908,0001,088,0002,113,536
7May 10, 2026 18:353,97941,697,22431,941,0001,090,0002,113,536
8May 10, 2026 18:354,02741,420,09232,371,0001,060,0002,113,536
9May 10, 2026 18:354,06541,307,19032,665,0001,079,0002,113,536