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 14:39Victor MerckléVictor MerckléScore: 2,756Success
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 14:402,70516,819,6065,418,0001,346,0002,113,536
2May 20, 2026 14:402,70614,683,7445,418,0001,347,0002,113,536
3May 20, 2026 14:402,71916,134,4625,450,0001,349,0002,113,536
4May 20, 2026 14:402,74714,816,2055,518,0001,350,0002,113,536
5May 20, 2026 14:402,75615,717,4775,539,0001,351,0002,113,536
6May 20, 2026 14:402,81216,442,1065,689,0001,342,0002,113,536
7May 20, 2026 14:402,81416,469,3065,671,0001,364,0002,113,536
8May 20, 2026 14:402,82017,260,8365,711,0001,339,0002,113,536
9May 20, 2026 14:402,85114,947,7335,787,0001,342,0002,113,536