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 13:30Victor MerckléVictor MerckléScore: 39,046Success
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 13:3138,394105,124,78089,753,0006,234,0002,117,632
2Jun 13, 2026 13:3138,572105,622,67989,256,0007,174,0002,117,632
3Jun 13, 2026 13:3138,958106,630,29190,217,0007,179,0002,117,632
4Jun 13, 2026 13:3139,034106,762,52791,188,0006,397,0002,117,632
5Jun 13, 2026 13:3139,046106,903,60191,427,0006,189,0002,117,632
6Jun 13, 2026 13:3139,528108,088,36991,627,0007,194,0002,117,632
7Jun 13, 2026 13:3139,646108,386,91191,951,0007,165,0002,117,632
8Jun 13, 2026 13:3139,770113,124,56392,294,0007,131,0002,117,632
9Jun 13, 2026 13:3140,202109,745,93693,436,0007,071,0002,117,632