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:50highload-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:50013,146,8292,722,0001,142,000524,288pos 0: expected 248 got 189
2Oct 19, 2026 12:50013,062,4952,612,0001,145,000524,288pos 0: expected 38 got 169
3Oct 19, 2026 12:50013,379,4483,073,0001,098,000524,288pos 0: expected 128 got 60