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 listJun 13, 2026 19:08Victor MerckléVictor MerckléScore: 25,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 19:0824,57570,738,45557,318,0004,121,0002,117,632
2Jun 13, 2026 19:0824,97272,164,05558,268,0004,163,0002,117,632
3Jun 13, 2026 19:0825,26672,291,31759,045,0004,121,0002,117,632
4Jun 13, 2026 19:0825,35172,555,93759,287,0004,092,0002,117,632
5Jun 13, 2026 19:0825,36772,618,30359,354,0004,065,0002,117,632
6Jun 13, 2026 19:0825,44972,969,50259,554,0004,069,0002,117,632
7Jun 13, 2026 19:0825,55973,203,77859,811,0004,088,0002,117,632
8Jun 13, 2026 19:0825,56373,145,27559,805,0004,103,0002,117,632
9Jun 13, 2026 19:0825,56573,092,50159,748,0004,165,0002,117,632