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 06:26Elijah KinElijah KinScore: 12,920Success
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 06:2612,91455,601,35528,250,0004,035,0002,473,984
2Mar 15, 2026 06:2612,92059,081,42229,272,0003,028,0002,424,832
3Mar 15, 2026 06:2612,94852,693,60628,324,0004,046,0002,457,600