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 06:52Kasper KivimäkiKasper KivimäkiScore: 16,466Success
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 06:5216,3292,506,960,2412,449,299,630016,912,384
2Aug 3, 2024 06:5216,3322,506,558,7472,449,726,302016,912,384
3Aug 3, 2024 06:5216,3382,508,411,6262,450,704,073017,039,360
4Aug 3, 2024 06:5216,4662,529,275,8552,469,863,492016,920,576
5Aug 3, 2024 06:5216,4712,555,124,8402,470,587,242016,904,192
6Aug 3, 2024 06:5216,4792,529,405,8912,471,880,081017,043,456