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 15:31Victor MerckléVictor MerckléScore: 2,827Success
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 15:332,70815,272,6825,426,0001,346,0002,113,536
2May 20, 2026 15:332,71914,535,9755,449,0001,350,0002,113,536
3May 20, 2026 15:332,74917,531,2535,524,0001,350,0002,113,536
4May 20, 2026 15:332,75714,529,5675,530,0001,364,0002,113,536
5May 20, 2026 15:332,82715,303,3675,726,0001,343,0002,113,536
6May 20, 2026 15:332,84115,972,9195,756,0001,347,0002,113,536
7May 20, 2026 15:332,84417,756,3905,772,0001,338,0002,113,536
8May 20, 2026 15:332,87514,903,8255,832,0001,356,0002,113,536
9May 20, 2026 15:332,90415,673,4424,943,0002,318,0002,113,536