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 listDec 19, 2025 15:10Josu San MartinJosu San MartinScore: 51,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 15:1051,044450,880,196422,667,000999,0002,281,472
2Dec 19, 2025 15:1051,054452,133,829422,751,000999,0002,285,568
3Dec 19, 2025 15:1051,061446,981,138421,806,0001,999,0002,281,472
4Dec 19, 2025 15:1051,092445,337,108423,065,0001,000,0002,285,568
5Dec 19, 2025 15:1051,097446,658,521423,102,0001,000,0002,359,296
6Dec 19, 2025 15:1051,126447,254,008423,343,0001,000,0002,367,488
7Dec 19, 2025 15:1051,126453,484,169423,343,0001,000,0002,351,104
8Dec 19, 2025 15:1051,163451,381,772422,653,0001,998,0002,359,296
9Dec 19, 2025 15:1051,171460,616,936423,722,000999,0002,285,568