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 listNov 8, 2026 05:07highload-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
1Nov 8, 2026 05:07010,165,5311,007,0000524,288pos 0: expected 240 got 0
2Nov 8, 2026 05:07010,170,1801,083,0000524,288pos 0: expected 17 got 0
3Nov 8, 2026 05:07010,102,0711,093,0000524,288pos 0: expected 244 got 0