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 15:39highload-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 15:3909,837,263851,00002,113,536pos 0: expected 16 got 24
2Oct 19, 2026 15:3909,749,207748,00002,113,536pos 0: expected 38 got 25
3Oct 19, 2026 15:3909,737,376749,00002,113,536pos 0: expected 240 got 208