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 listApr 28, 2026 00:23Victor 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
1Apr 28, 2026 00:23014,646,23801,597,0002,392,064pos 0: expected 26 got 48stderr
2Apr 28, 2026 00:23021,108,88901,756,0002,387,968pos 0: expected 163 got 48stderr
3Apr 28, 2026 00:23019,821,88601,560,0002,383,872pos 0: expected 173 got 48stderr