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:24Karthik 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:2409,814,43001,155,000520,192pos 0: expected 24 got 0
2Oct 7, 2026 21:2409,753,08701,100,000520,192pos 0: expected 39 got 0
3Oct 7, 2026 21:2409,892,66001,161,000520,192pos 0: expected 27 got 0