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 20, 2026 16:37M-RochatM-RochatScore: 4,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:374,55320,653,29110,296,0001,088,0002,117,632
2May 20, 2026 16:374,55720,683,23110,306,0001,087,0002,121,728
3May 20, 2026 16:374,55820,752,95010,308,0001,088,0002,117,632
4May 20, 2026 16:374,56220,730,27210,316,0001,089,0002,121,728
5May 20, 2026 16:374,56220,683,99210,316,0001,089,0002,117,632
6May 20, 2026 16:374,57320,770,42210,342,0001,091,0002,121,728
7May 20, 2026 16:374,67821,023,84910,601,0001,096,0002,117,632
8May 20, 2026 16:374,69021,048,41910,627,0001,100,0002,117,632
9May 20, 2026 16:374,69120,980,20610,632,0001,097,0002,117,632