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 listAug 18, 2026 03:46Victor MerckléVictor MerckléScore: 2,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 03:542,88417,299,6484,568,0002,643,0002,142,208stderr
2Aug 18, 2026 03:542,89417,335,9754,920,0002,315,0002,142,208stderr
3Aug 18, 2026 03:542,89817,346,6424,976,0002,270,0002,142,208stderr
4Aug 18, 2026 03:542,89817,253,5244,301,0002,944,0002,191,360stderr
5Aug 18, 2026 03:542,90017,319,3964,318,0002,932,0002,191,360stderr
6Aug 18, 2026 03:542,90117,308,8564,301,0002,952,0002,191,360stderr
7Aug 18, 2026 03:542,92217,305,3255,011,0002,296,0002,142,208stderr
8Aug 18, 2026 03:542,94817,360,5695,055,0002,317,0002,142,208stderr
9Aug 18, 2026 03:543,00331,388,3094,811,0002,697,0002,142,208stderr