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 12, 2026 14:12limanjun99limanjun99Score: 46,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 14:1246,769142,693,396111,926,0004,996,000909,312
2Apr 12, 2026 14:1246,837142,343,981114,091,0003,002,000819,200
3Apr 12, 2026 14:1246,889141,062,178114,218,0003,005,000835,584