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,827,4591,040,0000520,192pos 0: expected 72 got 1
2Oct 7, 2026 21:3709,813,0691,055,0000520,192pos 0: expected 128 got 1
3Oct 7, 2026 21:3709,875,6581,042,0000520,192pos 0: expected 8 got 1