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 13:11highload-churnerhighload-churnerScore: 1,550Success
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 13:111,48513,170,6022,431,0001,282,000524,288
2Oct 19, 2026 13:111,51713,340,7962,753,0001,041,000524,288
3Oct 19, 2026 13:111,52912,988,9602,506,0001,318,000524,288
4Oct 19, 2026 13:111,53413,424,0422,785,0001,051,000524,288
5Oct 19, 2026 13:111,55013,037,1602,535,0001,341,000524,288
6Oct 19, 2026 13:111,55413,004,1942,841,0001,046,000524,288
7Oct 19, 2026 13:111,57613,039,9182,573,0001,369,000524,288
8Oct 19, 2026 13:111,58213,423,8132,589,0001,366,000524,288
9Oct 19, 2026 13:111,60213,148,4852,661,0001,346,000524,288