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:47Kasper KivimäkiKasper KivimäkiScore: 20,048Success
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:4719,5072,996,406,4142,926,042,246016,912,384
2Aug 3, 2024 06:4719,5313,005,114,7732,929,707,787016,908,288
3Aug 3, 2024 06:4719,6313,006,192,8372,944,577,659016,912,384
4Aug 3, 2024 06:4619,9943,071,252,8572,999,105,110016,916,480
5Aug 3, 2024 06:4620,0483,074,039,2603,007,147,441016,912,384
6Aug 3, 2024 06:4620,1403,084,888,6603,021,062,824016,904,192
7Aug 3, 2024 06:4724,8763,792,802,7833,731,342,457016,920,576
8Aug 3, 2024 06:4724,8763,799,460,9633,731,363,694016,908,288
9Aug 3, 2024 06:4724,8813,771,177,5253,732,179,366016,908,288