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 20, 2026 03:11Dominique GarmierDominique GarmierScore: 8,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 02:418,75748,745,87418,908,0002,985,0002,277,376
2Mar 21, 2026 02:098,75846,802,40919,905,0001,990,0002,289,664
3Mar 20, 2026 11:338,75850,909,40517,914,0003,981,0002,297,856
4Mar 21, 2026 03:198,76349,338,26918,920,0002,987,0002,269,184
5Mar 21, 2026 03:198,76446,431,19217,926,0003,983,0002,363,392
6Mar 21, 2026 02:098,79345,698,43216,986,0004,996,0002,269,184
7Mar 21, 2026 03:198,80346,811,11918,007,0004,001,0002,506,752
8Mar 20, 2026 03:048,81544,824,28919,032,0003,005,0002,506,752
9Mar 21, 2026 02:098,82746,717,57119,059,0003,009,0002,289,664
10Mar 20, 2026 02:418,83442,407,23217,067,0005,019,0002,285,568
11Mar 21, 2026 01:208,84446,665,07119,095,0003,015,0002,277,376
12Mar 20, 2026 11:338,87547,277,27318,153,0004,034,0002,506,752
13Mar 21, 2026 01:208,93354,594,73517,258,0005,075,0002,273,280
14Mar 20, 2026 03:048,94747,718,30016,267,0006,100,0002,277,376
15Mar 20, 2026 03:118,97746,110,37819,382,0003,060,0002,482,176
16Mar 20, 2026 03:118,98651,195,81319,403,0003,063,0002,519,040
17Mar 21, 2026 01:208,98852,848,01616,608,0005,861,0002,265,088
18Mar 20, 2026 03:049,03352,148,64717,451,0005,132,0002,285,568
19Mar 20, 2026 11:339,09049,274,07817,561,0005,165,0002,273,280
20Mar 20, 2026 03:119,10359,579,26316,551,0006,206,0002,260,992
21Mar 20, 2026 02:419,15851,571,41517,918,0004,977,0002,273,280