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 20:49Dominique GarmierDominique GarmierScore: 8,816Success
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 20:458,67952,594,04119,631,0002,066,0002,383,872
2Mar 19, 2026 20:458,74049,932,80817,878,0003,973,0002,502,656
3Mar 19, 2026 20:498,75945,838,98017,917,0003,981,0002,285,568
4Mar 19, 2026 20:498,76050,858,37616,922,0004,977,0002,506,752
5Mar 19, 2026 20:498,76248,027,08717,922,0003,982,0002,326,528
6Mar 19, 2026 20:458,77543,932,11217,949,0003,988,0002,396,160
7Mar 19, 2026 20:458,78449,455,58717,967,0003,992,0002,285,568
8Mar 19, 2026 20:458,79743,488,41715,995,0005,998,0002,277,376
9Mar 19, 2026 20:458,81147,529,04417,022,0005,006,0002,473,984
10Mar 19, 2026 20:498,81648,387,72219,036,0003,005,0002,285,568
11Mar 19, 2026 20:458,82349,491,81116,042,0006,015,0002,330,624
12Mar 19, 2026 20:498,85048,659,33520,114,0002,011,0002,277,376
13Mar 19, 2026 20:498,95452,744,39818,491,0003,893,0002,289,664
14Mar 19, 2026 20:498,97051,932,93218,347,0004,077,0002,351,104
15Mar 19, 2026 20:459,00843,804,55519,450,0003,071,0002,277,376
16Mar 19, 2026 20:499,03346,820,80817,450,0005,132,0002,277,376
17Mar 19, 2026 20:499,03846,679,47716,432,0006,162,0002,277,376
18Mar 19, 2026 20:459,05146,147,74419,543,0003,085,0002,269,184