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 11:52Alexander MonakovAlexander MonakovScore: 3,937Success
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 11:523,922658,441,860588,246,134016,973,824
2Mar 26, 2023 11:523,936622,340,248585,405,0005,003,00017,088,512
3Mar 26, 2023 11:523,936616,913,792583,420,0007,005,00017,068,032
4Mar 26, 2023 11:523,937647,061,041590,615,560016,982,016
5Mar 26, 2023 11:523,937619,012,865580,550,0009,992,00017,072,128
6Mar 26, 2023 11:523,937614,081,930582,556,0007,993,00017,203,200
7Mar 26, 2023 11:523,937619,712,661586,557,0003,996,00017,108,992
8Mar 26, 2023 11:523,937616,190,751584,569,0005,995,00017,072,128
9Mar 26, 2023 11:523,938611,080,512577,673,00012,992,00017,129,472
10Mar 26, 2023 11:523,938618,793,749579,712,00010,994,00017,055,744
11Mar 26, 2023 11:523,939655,537,697590,893,989016,977,920
12Mar 26, 2023 11:523,944616,707,779579,641,00011,992,00017,133,568