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 16:45Victor MerckléVictor MerckléScore: 2,509Success
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 16:472,50113,795,1854,926,0001,328,0002,113,536
2Jun 1, 2026 16:472,50613,767,3064,936,0001,329,0002,113,536
3Jun 1, 2026 16:472,50613,775,5154,934,0001,331,0002,113,536
4Jun 1, 2026 16:472,50713,753,0674,938,0001,331,0002,113,536
5Jun 1, 2026 16:472,50913,856,8394,945,0001,329,0002,113,536
6Jun 1, 2026 16:472,52213,944,7694,970,0001,336,0002,113,536
7Jun 1, 2026 16:472,56214,157,8835,058,0001,348,0002,113,536
8Jun 1, 2026 16:472,60414,014,9535,182,0001,329,0002,113,536
9Jun 1, 2026 16:472,65814,173,8335,292,0001,353,0002,113,536