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 listApr 13, 2026 05:51limanjun99limanjun99Score: 4,515Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 05:514,49628,423,8569,197,0002,043,0002,289,664
2Apr 13, 2026 05:514,51528,762,1119,236,0002,052,0002,289,664
3Apr 13, 2026 05:514,56328,577,93610,370,0001,037,0002,502,656