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 11:27Victor MerckléVictor MerckléScore: 2,742Success
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 11:282,61514,150,6975,302,0001,236,0002,113,536
2May 29, 2026 11:282,62114,321,0145,312,0001,241,0002,113,536
3May 29, 2026 11:282,64816,330,9995,370,0001,251,0002,113,536
4May 29, 2026 11:282,66617,998,7825,407,0001,259,0002,113,536
5May 29, 2026 11:282,74216,299,5575,616,0001,239,0002,113,536
6May 29, 2026 11:282,74416,637,7895,618,0001,243,0002,113,536
7May 29, 2026 11:282,74814,619,1595,632,0001,240,0002,113,536
8May 29, 2026 11:282,75215,796,4725,641,0001,239,0002,113,536
9May 29, 2026 11:282,76415,015,6595,668,0001,242,0002,113,536