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 listMay 1, 2026 06:52Charles CabergsCharles CabergsScore: 4,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 06:524,59225,868,1327,307,0004,175,0002,547,712
2May 1, 2026 06:524,59830,029,5609,407,0002,090,0002,420,736
3May 1, 2026 06:524,60534,792,4448,374,0003,140,0002,424,832
4May 1, 2026 06:524,61434,630,1899,440,0002,097,0002,433,024
5May 1, 2026 06:524,63027,034,6399,471,0002,104,0002,428,928
6May 1, 2026 06:524,64527,561,11410,559,0001,055,0002,428,928
7May 1, 2026 06:524,67133,125,0757,432,0004,246,0002,424,832
8May 1, 2026 06:524,75828,282,5248,922,0002,974,0002,428,928
9May 1, 2026 06:524,75928,104,1117,932,0003,966,0002,420,736