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 listMar 26, 2023 10:50Alexander MonakovAlexander MonakovScore: 4,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 10:503,990667,172,096598,501,214017,010,688
2Mar 26, 2023 10:503,991660,178,566598,636,551017,006,592
3Mar 26, 2023 10:504,001665,871,970600,136,332017,006,592
4Mar 26, 2023 10:504,024628,139,068586,683,00016,990,00017,092,608
5Mar 26, 2023 10:504,025624,610,658589,718,00013,993,00017,104,896
6Mar 26, 2023 10:504,025623,870,338583,739,00019,991,00017,092,608
7Mar 26, 2023 10:504,026623,195,882585,899,00017,996,00017,121,280
8Mar 26, 2023 10:504,027629,459,343588,014,00016,000,00017,092,608
9Mar 26, 2023 10:504,027627,936,970584,020,00020,000,00016,949,248
10Mar 26, 2023 10:504,027628,758,555590,085,00014,002,00017,092,608
11Mar 26, 2023 10:504,028628,389,342587,125,00017,003,00017,162,240
12Mar 26, 2023 10:504,048632,579,821588,206,00019,006,00017,104,896