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:53Alexander MonakovAlexander MonakovScore: 4,000Success
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:533,973660,896,872595,909,171017,006,592
2Mar 26, 2023 10:533,974661,841,653596,158,694017,010,688
3Mar 26, 2023 10:533,986663,572,641597,955,514017,010,688
4Mar 26, 2023 10:533,999623,258,680583,836,00015,995,00016,994,304
5Mar 26, 2023 10:533,999628,205,597587,839,00011,996,00016,990,208
6Mar 26, 2023 10:533,999627,634,984585,907,00013,997,00016,994,304
7Mar 26, 2023 10:534,000627,765,000581,993,00017,999,00017,080,320
8Mar 26, 2023 10:534,001628,294,875582,088,00018,002,00017,186,816
9Mar 26, 2023 10:534,001624,707,588586,192,00014,004,00017,088,512
10Mar 26, 2023 10:534,002626,441,850583,293,00017,008,00017,137,664
11Mar 26, 2023 10:534,002630,599,161587,311,00013,006,00017,088,512
12Mar 26, 2023 10:534,003625,589,053586,387,00014,009,00017,100,800