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 listDec 27, 2024 10:02IhebIhebScore: 12,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2024 10:0212,6071,917,887,3391,865,051,00025,945,00017,043,456
2Dec 27, 2024 10:0212,6421,921,038,2871,874,276,00021,956,00017,043,456
3Dec 27, 2024 10:0212,6421,925,204,8181,879,331,00016,966,00017,047,552
4Dec 27, 2024 10:0212,6651,927,942,5921,877,854,00021,951,00017,125,376
5Dec 27, 2024 10:0212,6681,932,069,9401,874,277,00025,948,00017,035,264
6Dec 27, 2024 10:0212,6781,928,467,8571,876,756,00024,943,00017,063,936
7Dec 27, 2024 10:0212,7221,932,558,4451,883,323,00024,951,00017,043,456
8Dec 27, 2024 10:0212,7551,945,651,2711,884,324,00028,928,00016,961,536
9Dec 27, 2024 10:0212,7651,947,623,6981,888,845,00025,942,00017,182,720