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 listJul 9, 2023 22:21gchebanovgchebanovScore: 19,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 22:2118,43368,278,34540,072,0006,010,0002,375,680
2Jul 9, 2023 22:2118,73373,835,84839,858,0006,975,0002,297,856
3Jul 9, 2023 22:2118,76574,302,24136,932,0009,981,0002,306,048
4Jul 9, 2023 22:2118,84768,734,91440,101,0007,017,0002,383,872
5Jul 9, 2023 22:2118,995118,028,26047,486,33102,228,224
6Jul 9, 2023 22:2119,041110,551,06047,601,64702,240,512
7Jul 9, 2023 22:2119,39972,272,59541,425,0007,072,0002,387,968
8Jul 9, 2023 22:2119,42676,375,92442,495,0006,070,0002,441,216
9Jul 9, 2023 22:2119,57474,313,48338,948,0009,986,0002,387,968
10Jul 9, 2023 22:2119,586104,669,08248,965,04802,236,416
11Jul 9, 2023 22:2119,64071,641,96740,081,0009,018,0002,387,968
12Jul 9, 2023 22:2120,09677,672,13042,201,0008,038,0002,420,736