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 2, 2026 06:48Victor MerckléVictor MerckléScore: 82,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2026 06:5082,108228,406,947202,267,0003,003,0002,424,832stderr
2May 2, 2026 06:5082,127213,413,858202,314,0003,004,0002,367,488stderr
3May 2, 2026 06:5082,220213,655,384201,540,0004,010,0002,502,656stderr
4May 2, 2026 06:5082,221213,592,743202,546,0003,008,0002,367,488stderr
5May 2, 2026 06:5082,226213,685,662201,554,0004,011,0002,486,272stderr
6May 2, 2026 06:5082,228213,710,747203,565,0002,005,0002,371,584stderr
7May 2, 2026 06:5082,239213,585,928202,590,0003,008,0002,514,944stderr
8May 2, 2026 06:5082,250213,679,371202,617,0003,009,0002,478,080stderr
9May 2, 2026 06:5082,281213,836,387202,693,0003,010,0002,576,384stderr