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 listNov 17, 2025 16:44Yuriy LyfenkoYuriy LyfenkoScore: 24,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2025 06:5924,79885,022,42659,995,0001,999,0002,273,280
2Nov 17, 2025 16:4424,80687,012,04559,016,0003,000,0002,289,664
3Nov 17, 2025 06:5924,81786,483,18561,043,0001,000,0002,285,568
4Nov 17, 2025 06:5924,82486,699,20960,059,0002,001,0002,293,760
5Nov 17, 2025 06:5924,82585,840,14560,061,0002,002,0002,289,664
6Nov 17, 2025 06:5924,83884,146,23459,092,0003,004,0002,277,376
7Nov 17, 2025 16:4424,84484,154,70161,108,0001,001,0002,277,376
8Nov 17, 2025 06:5924,84783,365,41859,112,0003,005,0002,289,664
9Nov 17, 2025 16:4424,85385,145,87460,128,0002,004,0002,293,760
10Nov 17, 2025 06:5924,86284,287,72060,151,0002,005,0002,285,568
11Nov 17, 2025 16:4424,87392,990,20859,174,0003,008,0002,285,568
12Nov 17, 2025 06:5924,87885,972,01160,190,0002,006,0002,289,664
13Nov 17, 2025 16:4424,88390,007,14359,197,0003,010,0002,265,088
14Nov 17, 2025 16:4424,89483,672,23059,224,0003,011,0002,285,568
15Nov 17, 2025 16:4424,92085,550,67459,287,0003,014,0002,277,376
16Nov 17, 2025 16:4424,94087,978,19258,328,0004,022,0002,289,664
17Nov 17, 2025 16:4425,95292,185,00560,888,0003,992,0002,285,568
18Nov 17, 2025 06:5926,55292,782,43063,363,0003,017,0002,285,568