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 14:43limanjun99limanjun99Score: 3,165Success
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 14:433,04928,184,3375,445,0002,178,0002,531,328
2Apr 13, 2026 14:433,16525,108,0345,934,0001,978,0002,285,568
3Apr 13, 2026 14:433,17826,439,0864,965,0002,979,0002,523,136