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 listDec 3, 2023 20:08Sergey StreminSergey StreminScore: 49,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2023 20:0849,530159,481,929118,832,0004,992,0002,519,040
2Dec 3, 2023 20:0849,559157,148,465119,901,0003,996,0002,334,720
3Dec 3, 2023 20:0849,625150,054,019119,060,0005,002,0002,314,240
4Dec 3, 2023 20:0849,638151,565,800120,092,0004,003,0002,465,792
5Dec 3, 2023 20:0849,664185,686,169124,160,07302,273,280
6Dec 3, 2023 20:0849,728151,195,807121,314,0003,007,0002,289,664
7Dec 3, 2023 20:0849,760181,663,993124,400,70302,277,376
8Dec 3, 2023 20:0849,772157,655,742122,425,0002,006,0002,330,624
9Dec 3, 2023 20:0849,798152,417,371119,475,0005,019,0002,420,736
10Dec 3, 2023 20:0849,873151,199,273121,690,0002,992,0002,514,944
11Dec 3, 2023 20:0849,933155,107,457122,820,0002,013,0002,428,928
12Dec 3, 2023 20:0850,388180,319,373125,969,39402,285,568