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 listMar 22, 2026 16:07Dominique GarmierDominique GarmierScore: 2,183,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 16:071,935,8064,865,988,7134,835,518,0003,997,0002,383,872
2Mar 22, 2026 16:072,183,0075,489,386,9615,452,522,0004,996,0002,289,664
3Mar 22, 2026 16:072,243,0305,642,244,6165,599,578,0007,996,0002,314,240