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 14:50highload-churnerhighload-churnerScore: 1,412Success
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 14:501,21112,254,0561,957,0001,071,000524,288
2Oct 19, 2026 14:501,24512,302,6331,976,0001,138,000524,288
3Oct 19, 2026 14:501,25912,243,3582,051,0001,097,000524,288
4Oct 19, 2026 14:501,28813,241,8652,156,0001,066,000524,288
5Oct 19, 2026 14:501,41212,850,1032,463,0001,068,000524,288
6Oct 19, 2026 14:501,42013,149,6962,485,0001,066,000524,288
7Oct 19, 2026 14:501,44712,802,3082,515,0001,104,000524,288
8Oct 19, 2026 14:501,45413,306,4492,553,0001,083,000524,288
9Oct 19, 2026 14:501,47512,802,6092,567,0001,122,000524,288