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 12, 2024 19:02Yuriy LyfenkoYuriy LyfenkoScore: 55,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 19:0154,724161,868,449124,827,00011,983,0002,379,776
2Dec 12, 2024 19:0154,759165,112,198125,907,00010,991,0002,383,872
3Dec 12, 2024 19:0254,848167,206,311127,111,00010,008,0002,478,080
4Dec 12, 2024 19:0154,935164,910,611125,309,00012,029,0002,310,144
5Dec 12, 2024 19:0154,954161,014,312127,357,00010,028,0002,330,624
6Dec 12, 2024 19:0154,998161,350,290127,458,00010,036,0002,469,888
7Dec 12, 2024 19:0255,002162,014,849126,464,00011,040,0002,371,584
8Dec 12, 2024 19:0155,014171,696,668126,492,00011,043,0002,281,472
9Dec 12, 2024 19:0155,017165,107,101130,515,0007,027,0002,293,760
10Dec 12, 2024 19:0155,042163,137,062126,558,00011,048,0002,281,472
11Dec 12, 2024 19:0255,061165,008,750125,595,00012,057,0002,301,952
12Dec 12, 2024 19:0155,145164,641,353130,869,0006,993,0002,281,472