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 09:08limanjun99limanjun99Score: 3,180Success
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 09:083,17426,141,1974,960,0002,976,0002,269,184
2Apr 13, 2026 09:083,18024,010,0444,968,0002,981,0002,523,136
3Apr 13, 2026 09:083,29624,164,2315,150,0003,090,0002,273,280