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 08:28Alexander MonakovAlexander MonakovScore: 4,149Success
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 08:284,110677,781,115616,497,714016,998,400
2Mar 25, 2023 08:284,111679,244,687616,632,818017,006,592
3Mar 25, 2023 08:284,112681,021,607616,743,341016,883,712
4Mar 25, 2023 08:284,146649,285,105607,863,00013,996,00017,108,992
5Mar 25, 2023 08:284,146647,686,411604,872,00016,996,00017,068,032
6Mar 25, 2023 08:284,146643,347,522606,931,00014,998,00017,141,760
7Mar 25, 2023 08:284,149651,179,481605,324,00017,009,00017,088,512
8Mar 25, 2023 08:284,150643,920,209606,537,00015,987,00017,096,704
9Mar 25, 2023 08:284,276671,206,856623,437,00017,983,00017,002,496
10Mar 25, 2023 08:284,307671,006,338631,098,00015,002,00017,121,280
11Mar 25, 2023 08:284,326664,974,283633,957,00014,999,00017,145,856
12Mar 25, 2023 08:284,327671,613,185632,077,00017,002,00017,182,720