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 02:26Elijah KinElijah KinScore: 22,884Success
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 02:2622,63379,950,13055,572,0001,010,0002,310,144
2Mar 15, 2026 02:2622,88483,736,20756,208,0001,003,0002,265,088
3Mar 15, 2026 02:2622,95987,469,52654,377,0003,020,0002,265,088