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 listJun 24, 2025 11:17Valentin KofmanValentin KofmanScore: 6,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2025 11:176,30078,262,18350,276,0002,011,0002,289,664
2Jun 24, 2025 11:176,31381,006,11152,396,00002,273,280
3Jun 24, 2025 11:176,31674,251,79551,411,0001,008,0002,265,088
4Jun 24, 2025 11:176,32579,691,32051,491,0001,009,0002,289,664
5Jun 24, 2025 11:176,40576,375,98151,154,0002,006,0002,289,664
6Jun 24, 2025 11:176,40679,253,79551,166,0002,006,0002,273,280
7Jun 24, 2025 11:176,40875,000,58251,178,0002,006,0002,289,664
8Jun 24, 2025 11:176,41081,141,13751,194,0002,007,0002,265,088
9Jun 24, 2025 11:176,46580,973,36252,648,0001,012,0002,289,664
10Jun 24, 2025 11:178,29595,379,68066,851,0001,995,0002,289,664
11Jun 24, 2025 11:178,31694,941,51568,019,0001,000,0002,289,664
12Jun 24, 2025 11:178,384100,842,87168,577,0001,008,0002,289,664