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 6, 2025 15:05Rajarshi BasuRajarshi BasuScore: 6,266Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:056,24677,653,53348,848,0002,990,0002,281,472
2Dec 6, 2025 15:056,24777,911,61649,856,0001,994,0002,289,664
3Dec 6, 2025 15:056,25380,082,99749,907,0001,996,0002,289,664
4Dec 6, 2025 15:056,26080,379,92750,963,000999,0002,293,760
5Dec 6, 2025 15:056,26178,811,19949,971,0001,998,0002,289,664
6Dec 6, 2025 15:056,26285,238,59349,977,0001,999,0002,289,664
7Dec 6, 2025 15:056,26679,615,91851,009,0001,000,0002,289,664
8Dec 6, 2025 15:056,27086,524,38151,044,0001,000,0002,289,664
9Dec 6, 2025 15:056,27377,699,26950,065,0002,002,0002,281,472
10Dec 6, 2025 15:056,38683,075,94850,006,0003,000,0002,289,664
11Dec 6, 2025 15:056,38680,574,40751,001,0002,000,0002,289,664
12Dec 6, 2025 15:056,40780,981,30151,168,0002,006,0002,289,664