Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listDec 27, 2024 01:40Joad NacerJoad NacerScore: 4,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2024 01:414,213654,193,033591,939,00039,995,00017,084,416
2Dec 27, 2024 01:414,225657,142,293598,764,00034,986,00017,047,552
3Dec 27, 2024 01:414,225666,346,320588,704,00044,977,00016,953,344
4Dec 27, 2024 01:414,226651,453,574585,894,00047,991,00017,121,280
5Dec 27, 2024 01:414,227654,283,276591,070,00043,005,00017,133,568
6Dec 27, 2024 01:404,227654,215,583593,045,00041,003,00017,031,168
7Dec 27, 2024 01:414,228656,788,342593,176,00041,012,00017,047,552
8Dec 27, 2024 01:414,228660,454,033587,133,00047,010,00017,039,360
9Dec 27, 2024 01:414,228659,123,733588,122,00046,009,00017,047,552
10Dec 27, 2024 01:404,228657,815,344591,163,00043,011,00017,215,488
11Dec 27, 2024 01:414,230659,042,158595,475,00038,965,00017,051,648
12Dec 27, 2024 01:414,241655,675,400596,162,00040,010,00016,982,016
13Dec 27, 2024 01:414,242661,530,465599,291,00037,017,00017,047,552
14Dec 27, 2024 01:404,242658,371,102589,356,00046,948,00016,953,344
15Dec 27, 2024 01:414,245662,617,720589,764,00046,981,00017,022,976
16Dec 27, 2024 01:404,245664,732,822594,787,00041,985,00016,953,344
17Dec 27, 2024 01:404,250662,162,230596,525,00040,967,00017,039,360
18Dec 27, 2024 01:404,251661,406,506591,725,00045,978,00017,047,552
19Dec 27, 2024 01:404,279663,664,557601,915,00039,994,00017,063,936
20Dec 27, 2024 01:404,280662,823,407597,982,00043,998,00017,043,456
21Dec 27, 2024 01:404,284662,924,831602,570,00039,971,00017,133,568