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:25limanjun99limanjun99Score: 38,509Success
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:2538,426119,183,92092,063,0004,002,000917,504
2Apr 12, 2026 14:2538,509126,192,23294,268,0002,005,000839,680
3Apr 12, 2026 14:2538,572122,835,14193,418,0003,013,000901,120