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 12:17highload-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 12:18010,729,83601,271,000524,288pos 0: expected 206 got 0
2Oct 19, 2026 12:18010,389,38201,292,000524,288pos 1: expected 136 got 0
3Oct 19, 2026 12:18010,383,66901,261,000524,288pos 0: expected 116 got 0