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 23, 2025 07:07AnSaAnSaScore: 1,119,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 07:071,116,0482,819,475,4472,788,123,0001,998,0002,306,048
2Dec 23, 2025 07:071,117,8782,817,837,6402,793,697,000999,0002,293,760
3Dec 23, 2025 07:071,118,9042,827,947,3152,794,261,0002,998,0002,289,664
4Dec 23, 2025 07:071,119,1932,820,674,7822,796,984,000999,0002,289,664
5Dec 23, 2025 07:071,119,4232,821,759,2102,796,560,0001,998,0002,293,760
6Dec 23, 2025 07:071,120,9722,826,118,4312,800,431,0001,998,0002,289,664
7Dec 23, 2025 07:071,121,4082,831,843,8812,801,523,0001,998,0002,289,664
8Dec 23, 2025 07:071,122,9822,831,390,6092,806,456,000999,0002,293,760
9Dec 23, 2025 07:071,124,2742,842,106,7962,808,686,0001,999,0002,289,664