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 05:38Elijah KinElijah KinScore: 12,987Success
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 05:3812,98461,206,09728,402,0004,057,0002,445,312
2Mar 15, 2026 05:3812,98767,176,89328,409,0004,058,0002,461,696
3Mar 15, 2026 05:3813,00663,533,54329,467,0003,048,0002,379,776