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,025Success
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,992681,724,173598,791,372017,006,592
2Mar 26, 2023 10:503,993675,562,162598,904,000017,002,496
3Mar 26, 2023 10:503,994664,469,673599,110,628017,002,496
4Mar 26, 2023 10:504,025628,693,321584,755,00018,992,00017,117,184
5Mar 26, 2023 10:504,025628,504,402588,770,00014,994,00017,100,800
6Mar 26, 2023 10:504,025624,078,613587,826,00015,995,00017,108,992
7Mar 26, 2023 10:504,025629,691,567587,828,00015,995,00017,088,512
8Mar 26, 2023 10:504,026628,189,942588,840,00014,995,00017,104,896
9Mar 26, 2023 10:504,026625,784,080587,869,00015,996,00017,096,704
10Mar 26, 2023 10:504,027626,987,113590,010,00014,000,00017,199,104
11Mar 26, 2023 10:504,028630,057,618590,190,00014,004,00017,100,800
12Mar 26, 2023 10:504,032628,552,273591,867,00012,997,00017,125,376