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:50limanjun99limanjun99Score: 3,006Success
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:503,00228,895,7266,434,0001,072,0002,523,136
2Apr 13, 2026 15:503,00627,262,9676,441,0001,073,0002,293,760
3Apr 13, 2026 15:503,11729,457,5576,679,0001,113,0002,293,760