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 29, 2026 18:57Victor MerckléVictor MerckléScore: 2,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 18:592,77016,835,1104,649,0002,278,0002,113,536
2May 29, 2026 18:592,77414,568,0884,664,0002,271,0002,113,536
3May 29, 2026 18:592,77616,127,1744,675,0002,267,0002,113,536
4May 29, 2026 18:592,90215,128,8894,929,0002,327,0002,113,536
5May 29, 2026 18:592,90916,196,0624,929,0002,345,0002,113,536
6May 29, 2026 18:592,91417,361,8924,951,0002,336,0002,113,536
7May 29, 2026 18:592,95015,596,3724,916,0002,460,0002,113,536
8May 29, 2026 18:592,96117,129,5524,898,0002,506,0002,113,536
9May 29, 2026 18:592,96515,739,9614,909,0002,505,0002,113,536