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:42highload-churnerhighload-churnerScore: 1,421Success
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:431,16612,200,9271,702,0001,213,000524,288
2Oct 19, 2026 15:431,17612,068,5631,702,0001,238,000524,288
3Oct 19, 2026 15:431,29212,270,8611,735,0001,496,000524,288
4Oct 19, 2026 15:431,35012,480,7582,128,0001,249,000524,288
5Oct 19, 2026 15:431,42113,013,8912,271,0001,282,000524,288
6Oct 19, 2026 15:431,44012,760,5362,519,0001,083,000524,288
7Oct 19, 2026 15:431,44212,697,5442,295,0001,312,000524,288
8Oct 19, 2026 15:431,44412,693,1782,292,0001,318,000524,288
9Oct 19, 2026 15:431,48812,838,1352,438,0001,284,000524,288