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 9, 2026 21:34highload-churnerhighload-churnerScore: 12,276Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 22:1012,14440,898,81728,249,0002,111,0002,117,632
2Oct 9, 2026 22:1012,21141,081,74027,452,0003,077,0002,117,632
3Oct 9, 2026 22:1012,22941,073,79427,472,0003,101,0002,117,632
4Oct 9, 2026 22:1012,24842,195,38927,543,0003,077,0002,117,632
5Oct 9, 2026 22:1012,27641,396,80027,601,0003,090,0002,117,632
6Oct 9, 2026 22:1012,29141,951,63527,577,0003,151,0002,117,632
7Oct 9, 2026 22:1012,30441,991,02127,586,0003,174,0002,117,632
8Oct 9, 2026 22:1012,35642,825,51127,780,0003,111,0002,117,632
9Oct 9, 2026 22:1012,40841,696,65127,787,0003,233,0002,117,632