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:23Karthik 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:23010,417,15201,149,000520,192pos 0: expected 40 got 116
2Oct 7, 2026 21:23010,287,88801,173,000520,192pos 0: expected 196 got 114
3Oct 7, 2026 21:23010,342,85701,168,000520,192pos 0: expected 0 got 160