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 15, 2026 21:07Elijah KinElijah KinScore: 13,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 21:0712,90657,658,55829,241,0003,024,0002,301,952
2Mar 15, 2026 21:0713,01962,066,43828,479,0004,068,0002,301,952
3Mar 15, 2026 21:0713,01956,884,74330,514,0002,034,0002,265,088