Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listDec 3, 2023 20:07Sergey StreminSergey StreminScore: 49,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2023 20:0749,434153,868,503118,561,0005,023,0002,269,184
2Dec 3, 2023 20:0749,530154,416,691120,831,0002,995,0002,383,872
3Dec 3, 2023 20:0749,533151,765,626118,839,0004,993,0002,297,856
4Dec 3, 2023 20:0749,585151,884,393118,964,0004,998,0002,301,952
5Dec 3, 2023 20:0749,613147,756,986121,032,0003,000,0002,314,240
6Dec 3, 2023 20:0749,626188,656,236124,065,78002,281,472
7Dec 3, 2023 20:0749,647150,753,127120,114,0004,003,0002,498,560
8Dec 3, 2023 20:0749,749155,405,990121,363,0003,009,0002,355,200
9Dec 3, 2023 20:0749,773154,468,505119,416,0005,017,0002,351,104
10Dec 3, 2023 20:0749,784181,503,309124,459,35702,285,568
11Dec 3, 2023 20:0749,924151,101,121119,819,0004,992,0002,387,968
12Dec 3, 2023 20:0750,715189,440,783126,788,44702,269,184