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 27, 2026 04:42Victor MerckléVictor MerckléScore: 2,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 04:432,68916,371,2194,227,0002,497,0002,142,208
2Jun 27, 2026 04:432,71017,649,3624,207,0002,569,0002,142,208
3Jun 27, 2026 04:432,74416,529,4194,088,0002,773,0002,142,208
4Jun 27, 2026 04:432,75316,381,5984,260,0002,624,0002,142,208
5Jun 27, 2026 04:432,80116,103,5504,432,0002,572,0002,142,208
6Jun 27, 2026 04:432,83416,774,2414,452,0002,635,0002,142,208
7Jun 27, 2026 04:432,84516,448,3334,456,0002,658,0002,142,208
8Jun 27, 2026 04:432,88816,452,7814,605,0002,617,0002,142,208
9Jun 27, 2026 04:432,89616,638,3034,968,0002,273,0002,142,208