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 22:38Victor MerckléVictor MerckléScore: 6,081Success
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 22:385,78423,637,75811,243,0003,218,0002,117,632
2Jun 13, 2026 22:385,78723,615,83311,251,0003,218,0002,117,632
3Jun 13, 2026 22:385,79023,688,86311,263,0003,212,0002,117,632
4Jun 13, 2026 22:386,04024,221,81911,884,0003,217,0002,117,632
5Jun 13, 2026 22:386,08124,345,03911,969,0003,235,0002,117,632
6Jun 13, 2026 22:386,13524,442,72212,106,0003,232,0002,117,632
7Jun 13, 2026 22:386,20424,636,18512,308,0003,204,0002,117,632
8Jun 13, 2026 22:386,22624,739,10312,379,0003,188,0002,117,632
9Jun 13, 2026 22:386,33826,084,95812,633,0003,212,0002,117,632