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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 21:582,17413,391,1014,182,0001,253,0002,117,632stderr
2Jun 30, 2026 21:582,17913,363,1454,195,0001,254,0002,117,632stderr
3Jun 30, 2026 21:582,18113,335,2834,199,0001,254,0002,117,632stderr
4Jun 30, 2026 21:582,18213,383,9454,202,0001,254,0002,117,632stderr
5Jun 30, 2026 21:582,18813,346,7704,214,0001,257,0002,117,632stderr
6Jun 30, 2026 21:582,22113,961,1554,302,0001,252,0002,117,632stderr
7Jun 30, 2026 21:582,22913,733,1034,323,0001,250,0002,117,632stderr
8Jun 30, 2026 21:582,24213,589,3774,353,0001,254,0002,117,632stderr
9Jun 30, 2026 21:582,25613,890,9004,386,0001,255,0002,117,632stderr