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 listJun 29, 2025 22:31Aniruddha DebAniruddha DebScore: 7,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2025 22:316,89035,716,76512,159,0005,066,0002,285,568
2Jun 29, 2025 22:316,89742,841,01613,185,0004,057,0002,289,664
3Jun 29, 2025 22:316,90043,955,43013,191,0004,059,0002,260,992
4Jun 29, 2025 22:316,90042,887,39913,191,0004,059,0002,510,848
5Jun 29, 2025 22:316,92241,351,53312,215,0005,089,0002,519,040
6Jun 29, 2025 22:316,92348,129,94214,253,0003,054,0002,498,560
7Jun 29, 2025 22:316,97234,193,80712,304,0005,126,0002,519,040
8Jun 29, 2025 22:316,98143,454,10912,320,0005,133,0002,510,848
9Jun 29, 2025 22:316,99133,298,89812,338,0005,140,0002,359,296
10Jun 29, 2025 22:317,00144,367,27613,385,0004,118,0002,289,664
11Jun 29, 2025 22:317,04338,161,05613,465,0004,143,0002,519,040
12Jun 29, 2025 22:317,07438,410,22413,524,0004,161,0002,338,816
13Jun 29, 2025 22:317,07537,622,36314,567,0003,121,0002,510,848
14Jun 29, 2025 22:317,09541,986,56314,608,0003,130,0002,265,088
15Jun 29, 2025 22:317,09745,622,71113,568,0004,175,0002,265,088
16Jun 29, 2025 22:317,15638,543,58212,921,0004,969,0002,355,200
17Jun 29, 2025 22:317,16951,613,60213,940,0003,982,0002,519,040
18Jun 29, 2025 22:317,68244,547,89215,162,0004,043,0002,265,088