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 listMar 19, 2026 02:04Dominique GarmierDominique GarmierScore: 14,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 00:1314,30665,499,48831,678,0004,087,0002,338,816
2Mar 19, 2026 00:1314,33963,538,57631,864,0003,983,0002,437,120
3Mar 19, 2026 00:1314,35361,595,96534,887,000996,0002,424,832
4Mar 19, 2026 00:1314,35866,222,52431,906,0003,988,0002,519,040
5Mar 19, 2026 00:1314,36163,072,31930,916,0004,986,0002,437,120
6Mar 19, 2026 00:1314,37859,683,73931,951,0003,993,0002,293,760
7Mar 19, 2026 00:1314,37861,228,61332,950,0002,995,0002,478,080
8Mar 19, 2026 00:1314,39658,700,25931,991,0003,998,0002,433,024
9Mar 19, 2026 00:1314,40857,287,46431,017,0005,002,0002,437,120
10Mar 19, 2026 02:0414,50158,657,33130,211,0006,042,0002,371,584
11Mar 19, 2026 02:0414,50858,931,59731,234,0005,037,0002,519,040
12Mar 19, 2026 02:0414,54458,536,87330,301,0006,060,0002,506,752