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:27M-RochatM-RochatScore: 4,708Success
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:284,60820,851,56710,427,0001,093,0002,113,536
2May 20, 2026 16:284,61320,925,79610,440,0001,094,0002,117,632
3May 20, 2026 16:284,62020,844,01810,457,0001,094,0002,121,728
4May 20, 2026 16:284,64320,953,60910,516,0001,093,0002,117,632
5May 20, 2026 16:284,70821,053,15010,666,0001,105,0002,121,728
6May 20, 2026 16:284,72821,211,61110,721,0001,101,0002,117,632
7May 20, 2026 16:284,73021,140,30610,722,0001,105,0002,117,632
8May 20, 2026 16:284,73121,123,64110,726,0001,102,0002,121,728
9May 20, 2026 16:284,75821,770,1049,863,0002,033,0002,117,632