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 listMar 8, 2025 14:13alfaixalfaixScore: 36,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2025 14:1336,818330,345,493305,586,00002,277,376
2Mar 8, 2025 14:1336,830332,882,589302,696,0002,996,0002,289,664
3Mar 8, 2025 14:1336,832330,904,944303,711,0001,998,0002,281,472
4Mar 8, 2025 14:1336,836334,030,446304,741,000999,0002,281,472
5Mar 8, 2025 14:1336,838329,070,878303,759,0001,998,0002,281,472
6Mar 8, 2025 14:1336,839328,798,405302,753,0003,007,0002,293,760
7Mar 8, 2025 14:1336,847328,994,608302,829,0002,998,0002,281,472
8Mar 8, 2025 14:1336,848334,133,602303,843,0001,998,0002,281,472
9Mar 8, 2025 14:1336,849334,749,286304,846,000999,0002,281,472