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 2, 2026 00:56Victor MerckléVictor MerckléScore: 2,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 00:582,28713,358,4254,489,0001,229,0002,113,536
2Jun 2, 2026 00:582,28913,371,6774,485,0001,239,0002,113,536
3Jun 2, 2026 00:582,29013,370,2124,497,0001,230,0002,113,536
4Jun 2, 2026 00:582,31215,647,7964,536,0001,246,0002,113,536
5Jun 2, 2026 00:582,39013,880,8774,751,0001,224,0002,113,536
6Jun 2, 2026 00:582,39513,573,3804,762,0001,227,0002,113,536
7Jun 2, 2026 00:582,39713,881,9554,767,0001,227,0002,113,536
8Jun 2, 2026 00:582,40414,013,7354,781,0001,231,0002,113,536
9Jun 2, 2026 00:582,52421,516,7304,098,0002,214,0002,113,536