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:09Kasper KivimäkiKasper KivimäkiScore: 20,972Success
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:0919,5373,003,754,0982,930,514,500016,908,288
2Aug 3, 2024 07:0919,5933,007,097,6272,938,928,449017,039,360
3Aug 3, 2024 07:0919,6783,019,040,5352,951,750,315016,900,096
4Aug 3, 2024 07:0920,9723,203,649,0733,145,768,970016,912,384
5Aug 3, 2024 07:0920,9733,203,786,1613,145,961,447017,047,552
6Aug 3, 2024 07:0921,0473,225,368,1353,157,116,213016,908,288