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 12:51highload-churnerhighload-churnerScore: 1,805Success
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 12:521,58213,230,5312,839,0001,118,000524,288
2Oct 19, 2026 12:521,62318,329,0822,955,0001,104,000524,288
3Oct 19, 2026 12:521,63413,278,7542,936,0001,149,000524,288
4Oct 19, 2026 12:521,75013,574,1953,216,0001,161,000524,288
5Oct 19, 2026 12:521,80513,895,9423,445,0001,069,000524,288
6Oct 19, 2026 12:521,81013,737,2893,438,0001,087,000524,288
7Oct 19, 2026 12:521,81813,815,6663,459,0001,086,000524,288
8Oct 19, 2026 12:521,84114,284,4573,505,0001,099,000524,288
9Oct 19, 2026 12:521,87013,949,9753,352,0001,324,000524,288