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 17:36Victor MerckléVictor MerckléScore: 2,687Success
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 17:382,56914,028,6705,113,0001,310,0002,113,536
2May 29, 2026 17:382,63015,755,2105,228,0001,347,0002,113,536
3May 29, 2026 17:382,63714,392,2985,246,0001,348,0002,113,536
4May 29, 2026 17:382,68214,630,8815,400,0001,307,0002,113,536
5May 29, 2026 17:382,68714,287,0095,410,0001,308,0002,113,536
6May 29, 2026 17:382,69014,738,3925,418,0001,307,0002,113,536
7May 29, 2026 17:382,69214,501,9365,417,0001,313,0002,113,536
8May 29, 2026 17:382,69814,418,2185,434,0001,311,0002,113,536
9May 29, 2026 17:382,71614,527,3855,471,0001,320,0002,113,536