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 19, 2026 11:43highload-churnerhighload-churnerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 11:4309,988,947906,00002,117,632pos 0: expected 160 got 0
2Oct 19, 2026 11:43010,029,696907,00002,117,632pos 0: expected 66 got 0
3Oct 19, 2026 11:4309,986,254912,00002,117,632pos 0: expected 200 got 0