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:09highload-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:09010,092,76901,165,000524,288pos 0: expected 114 got 0
2Nov 8, 2026 05:09010,241,91501,243,000524,288pos 0: expected 255 got 0
3Nov 8, 2026 05:09010,230,94701,238,000524,288pos 0: expected 22 got 0