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:54Victor MerckléVictor MerckléScore: 38,947Success
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:5538,615105,762,32789,486,0007,053,0002,117,632
2Jun 13, 2026 19:5538,622105,775,05189,347,0007,210,0002,117,632
3Jun 13, 2026 19:5538,683105,923,10689,641,0007,067,0002,117,632
4Jun 13, 2026 19:5538,828106,246,68089,983,0007,089,0002,117,632
5Jun 13, 2026 19:5538,947106,509,35690,237,0007,132,0002,117,632
6Jun 13, 2026 19:5539,016106,667,74690,152,0007,388,0002,117,632
7Jun 13, 2026 19:5539,073106,936,15690,658,0007,026,0002,117,632
8Jun 13, 2026 19:5539,326107,632,92090,959,0007,358,0002,117,632
9Jun 13, 2026 19:5540,060110,956,07092,861,0007,289,0002,117,632