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 30, 2026 11:32Victor MerckléVictor MerckléScore: 2,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 11:332,52914,068,7374,999,0001,325,0002,113,536
2May 30, 2026 11:332,53416,912,8245,006,0001,330,0002,113,536
3May 30, 2026 11:332,54915,907,7235,042,0001,331,0002,113,536
4May 30, 2026 11:332,58614,631,5665,111,0001,354,0002,113,536
5May 30, 2026 11:332,61217,450,5445,208,0001,324,0002,113,536
6May 30, 2026 11:332,62414,222,5424,263,0002,297,0002,113,536
7May 30, 2026 11:332,63115,968,3715,254,0001,324,0002,113,536
8May 30, 2026 11:332,63816,085,6545,268,0001,329,0002,113,536
9May 30, 2026 11:332,68416,065,7704,449,0002,263,0002,113,536