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 25, 2023 10:44Alexander MonakovAlexander MonakovScore: 4,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 10:444,158699,287,354623,749,251016,994,304
2Mar 25, 2023 10:444,172693,774,358625,753,848017,010,688
3Mar 25, 2023 10:444,177649,912,097608,572,00017,987,00017,096,704
4Mar 25, 2023 10:444,181648,546,830610,083,00017,002,00017,002,496
5Mar 25, 2023 10:444,181652,208,156606,089,00021,003,00017,035,264
6Mar 25, 2023 10:444,182649,002,162605,247,00022,008,00017,096,704
7Mar 25, 2023 10:444,189654,974,314608,434,00019,981,00017,088,512
8Mar 25, 2023 10:444,190650,414,873613,564,00014,989,00017,100,800
9Mar 25, 2023 10:444,198650,790,308614,738,00014,993,00017,096,704
10Mar 25, 2023 10:444,218654,693,507617,696,00014,992,00017,100,800
11Mar 25, 2023 10:444,280695,213,460642,007,341017,010,688
12Mar 25, 2023 10:444,343676,260,939631,505,00019,984,00016,982,016