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 18, 2023 08:50unsatcoreunsatcoreScore: 12,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2023 08:5012,403125,306,69499,948,0002,998,0002,371,584
2Jan 18, 2023 08:5012,406126,414,086100,969,0001,999,0002,527,232
3Jan 18, 2023 08:5012,555125,460,044102,203,0002,003,0002,510,848
4Jan 18, 2023 08:5012,574129,093,438104,361,00002,277,376
5Jan 18, 2023 08:5012,577126,052,927101,375,0003,011,0002,265,088
6Jan 18, 2023 08:5012,587132,497,607103,472,0001,004,0002,355,200
7Jan 18, 2023 08:5012,588129,216,063103,478,0001,004,0002,277,376
8Jan 18, 2023 08:5012,594134,697,910103,527,0001,005,0002,519,040
9Jan 18, 2023 08:5012,606133,383,501102,616,0002,012,0002,514,944
10Jan 18, 2023 08:5012,788174,372,492106,144,27802,273,280
11Jan 18, 2023 08:5012,923184,619,186107,262,25902,285,568
12Jan 18, 2023 08:5013,238166,444,352109,875,66402,281,472