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 listOct 15, 2024 20:44Elnur RakhmatullinElnur RakhmatullinScore: 49,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 20:4449,352432,615,710407,624,0001,998,0002,375,680
2Oct 15, 2024 20:4449,365441,724,392407,730,0001,998,0002,277,376
3Oct 15, 2024 20:4449,367436,357,979405,753,0003,997,0002,277,376
4Oct 15, 2024 20:4449,368441,711,014406,758,0002,998,0002,277,376
5Oct 15, 2024 20:4449,377436,000,223407,834,0001,999,0002,273,280
6Oct 15, 2024 20:4449,378436,246,067406,838,0002,998,0002,277,376
7Oct 15, 2024 20:4449,382439,825,847406,874,0002,999,0002,531,328
8Oct 15, 2024 20:4449,383438,172,369407,883,0001,999,0002,277,376
9Oct 15, 2024 20:4449,400436,183,960407,020,0003,000,0002,277,376