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 15:24limanjun99limanjun99Score: 3,076Success
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 15:243,06426,551,8396,566,0001,094,0002,293,760
2Apr 13, 2026 15:243,07625,090,1566,591,0001,098,0002,523,136
3Apr 13, 2026 15:243,07623,173,5745,493,0002,197,0002,523,136