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 1, 2026 12:58Victor MerckléVictor MerckléScore: 2,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 13:002,51914,129,0144,970,0001,329,0002,113,536
2Jun 1, 2026 13:002,52213,875,1624,981,0001,326,0002,113,536
3Jun 1, 2026 13:002,60913,990,8435,201,0001,322,0002,113,536
4Jun 1, 2026 13:002,61714,097,7405,218,0001,326,0002,113,536
5Jun 1, 2026 13:002,61813,980,9885,213,0001,332,0002,113,536
6Jun 1, 2026 13:002,62214,271,2835,233,0001,323,0002,113,536
7Jun 1, 2026 13:002,62214,041,9555,235,0001,322,0002,113,536
8Jun 1, 2026 13:002,62514,104,4835,236,0001,327,0002,113,536
9Jun 1, 2026 13:002,63214,133,5265,227,0001,355,0002,113,536