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 31, 2023 15:26unsatcoreunsatcoreScore: 11,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2023 15:2611,741121,583,64596,450,0001,004,0002,277,376
2Jan 31, 2023 15:2611,761129,812,41996,612,0001,006,0002,269,184
3Jan 31, 2023 15:2611,766122,519,39997,660,00002,527,232
4Jan 31, 2023 15:2611,781124,100,99995,785,0001,995,0002,359,296
5Jan 31, 2023 15:2611,819118,147,63896,096,0002,002,0002,260,992
6Jan 31, 2023 15:2611,918122,003,15796,925,0001,998,0002,260,992
7Jan 31, 2023 15:2611,928170,540,33398,999,34802,281,472
8Jan 31, 2023 15:2611,941170,012,39599,112,84402,277,376
9Jan 31, 2023 15:2612,030129,302,04797,853,0001,997,0002,277,376
10Jan 31, 2023 15:2612,060128,775,98598,095,0002,001,0002,277,376
11Jan 31, 2023 15:2612,092122,115,62198,359,0002,007,0002,523,136
12Jan 31, 2023 15:2612,097163,876,360100,401,63502,281,472