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 12, 2026 03:54Victor MerckléVictor MerckléScore: 18,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 03:5518,76461,243,66440,205,0006,706,0002,113,536
2Jun 12, 2026 03:5518,80154,665,75340,313,0006,690,0002,113,536
3Jun 12, 2026 03:5518,88454,822,61340,587,0006,624,0002,113,536
4Jun 12, 2026 03:5518,91255,074,96740,463,0006,818,0002,113,536
5Jun 12, 2026 03:5518,93955,170,39040,498,0006,850,0002,113,536
6Jun 12, 2026 03:5518,97755,294,46840,746,0006,698,0002,113,536
7Jun 12, 2026 03:5519,00655,358,04840,692,0006,824,0002,113,536
8Jun 12, 2026 03:5519,08355,242,33140,817,0006,892,0002,113,536
9Jun 12, 2026 03:5519,09255,469,18840,826,0006,905,0002,113,536