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 11:03Rajarshi BasuRajarshi BasuScore: 6,761Success
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 11:036,73082,530,31253,867,0001,995,0002,289,664
2Dec 6, 2025 11:036,74080,753,64753,948,0001,998,0002,527,232
3Dec 6, 2025 11:036,74187,390,89053,951,0001,998,0002,289,664
4Dec 6, 2025 11:036,74782,616,32054,000,0002,000,0002,281,472
5Dec 6, 2025 11:036,75080,341,03354,021,0002,000,0002,277,376
6Dec 6, 2025 11:036,75780,661,83053,083,0003,004,0002,281,472
7Dec 6, 2025 11:036,76185,080,33753,114,0003,006,0002,293,760
8Dec 6, 2025 11:036,77181,906,12053,188,0003,010,0002,289,664
9Dec 6, 2025 11:036,77382,837,51855,212,0001,003,0002,289,664
10Dec 6, 2025 11:036,90784,250,03655,316,0002,011,0002,523,136
11Dec 6, 2025 11:036,90779,990,69255,316,0002,011,0002,281,472
12Dec 6, 2025 11:036,92080,668,07255,419,0002,015,0002,289,664