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 13:44Victor MerckléVictor MerckléScore: 2,767Success
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 13:452,75416,326,6125,749,0001,137,0002,113,536
2May 20, 2026 13:452,76015,308,0325,762,0001,139,0002,113,536
3May 20, 2026 13:452,76014,679,9405,764,0001,136,0002,113,536
4May 20, 2026 13:452,76214,738,6575,768,0001,139,0002,113,536
5May 20, 2026 13:452,76717,581,8725,780,0001,138,0002,113,536
6May 20, 2026 13:452,80314,772,2025,851,0001,158,0002,113,536
7May 20, 2026 13:452,87415,451,7436,043,0001,142,0002,113,536
8May 20, 2026 13:452,89614,901,1636,090,0001,150,0002,113,536
9May 20, 2026 13:452,90321,311,0086,105,0001,154,0002,113,536