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 listSep 9, 2026 15:57Victor MerckléVictor MerckléScore: 1,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 15:581,59412,555,7852,813,0001,173,0002,117,632stderr
2Sep 9, 2026 15:581,60412,599,1832,824,0001,187,0002,117,632stderr
3Sep 9, 2026 15:581,60512,410,7332,816,0001,197,0002,117,632stderr
4Sep 9, 2026 15:581,67612,732,7982,979,0001,213,0002,117,632stderr
5Sep 9, 2026 15:581,67812,820,3132,996,0001,200,0002,117,632stderr
6Sep 9, 2026 15:581,69612,807,1733,022,0001,218,0002,117,632stderr
7Sep 9, 2026 15:581,70612,642,4433,025,0001,242,0002,117,632stderr
8Sep 9, 2026 15:581,71012,887,1583,058,0001,218,0002,117,632stderr
9Sep 9, 2026 15:581,77613,031,1533,214,0001,228,0002,117,632stderr