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 listAug 3, 2024 07:14Kasper KivimäkiKasper KivimäkiScore: 18,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2024 07:1516,7542,581,088,1972,513,153,710017,039,360
2Aug 3, 2024 07:1516,7562,580,843,2272,513,411,214016,912,384
3Aug 3, 2024 07:1516,7612,579,580,9352,514,219,609016,912,384
4Aug 3, 2024 07:1418,5682,844,793,5892,785,247,010017,047,552
5Aug 3, 2024 07:1418,5732,848,829,5122,785,951,354016,908,288
6Aug 3, 2024 07:1418,6162,853,585,8302,792,375,415016,908,288
7Aug 3, 2024 07:1421,4503,283,701,6853,217,496,357016,912,384
8Aug 3, 2024 07:1421,5993,338,537,5123,239,840,388016,986,112
9Aug 3, 2024 07:1421,7073,313,302,3873,256,105,118016,908,288