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 listJan 30, 2023 13:44unsatcoreunsatcoreScore: 15,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2023 13:4415,149151,575,731123,744,0001,995,0002,523,136
2Jan 30, 2023 13:4415,151153,357,034124,745,0001,006,0002,281,472
3Jan 30, 2023 13:4415,157152,008,661123,809,0001,996,0002,281,472
4Jan 30, 2023 13:4415,159153,660,671123,822,0001,997,0002,281,472
5Jan 30, 2023 13:4415,197148,451,900124,132,0002,002,0002,281,472
6Jan 30, 2023 13:4415,205150,721,788124,200,0002,003,0002,523,136
7Jan 30, 2023 13:4415,207150,156,834124,219,0002,003,0002,265,088
8Jan 30, 2023 13:4415,233151,626,351124,432,0002,006,0002,281,472
9Jan 30, 2023 13:4415,244153,794,379126,522,00002,527,232
10Jan 30, 2023 13:4415,866194,915,578131,684,18202,277,376
11Jan 30, 2023 13:4416,008202,416,869132,869,79102,277,376
12Jan 30, 2023 13:4416,089187,680,682133,536,84302,281,472