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 27, 2026 18:23Elijah KinElijah KinScore: 6,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2026 18:256,46828,010,81912,888,0003,284,0002,113,536
2May 27, 2026 18:256,57026,256,46713,100,0003,327,0002,113,536
3May 27, 2026 18:256,59725,620,39413,171,0003,323,0002,113,536
4May 27, 2026 18:256,64327,881,17613,301,0003,308,0002,113,536
5May 27, 2026 18:256,66227,142,33213,482,0003,174,0002,113,536
6May 27, 2026 18:256,67827,470,02413,324,0003,371,0002,113,536
7May 27, 2026 18:256,70626,328,18713,351,0003,415,0002,113,536
8May 27, 2026 18:256,90829,575,08613,849,0003,422,0002,113,536
9May 27, 2026 18:256,98629,721,74413,972,0003,494,0002,113,536