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 listOct 7, 2026 21:37Karthik ReddyKarthik ReddyError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 21:3709,585,088886,0000520,192pos 0: expected 179 got 0
2Oct 7, 2026 21:3709,746,647882,0000520,192pos 0: expected 205 got 0
3Oct 7, 2026 21:3709,520,776861,0000520,192pos 0: expected 216 got 0