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 7, 2026 06:52Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 06:52020,752,98202,296,0002,523,136pos 0: expected 20 got 48stderr
2May 7, 2026 06:52020,198,11502,337,0002,519,040pos 0: expected 222 got 48stderr
3May 7, 2026 06:52019,482,08602,349,0002,519,040pos 0: expected 194 got 48stderr