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:13Kasper KivimäkiKasper KivimäkiScore: 17,181Success
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:1216,5302,535,209,3962,479,532,462016,904,192
2Aug 3, 2024 07:1216,7342,573,512,3242,510,113,596016,904,192
3Aug 3, 2024 07:1216,7432,580,788,1322,511,401,164017,039,360
4Aug 3, 2024 07:1217,1802,641,595,6062,576,981,641016,896,000
5Aug 3, 2024 07:1217,1812,632,751,9642,577,179,365016,904,192
6Aug 3, 2024 07:1217,2012,640,142,6962,580,224,453016,904,192
7Aug 3, 2024 07:1321,5043,284,087,2263,225,618,886016,904,192
8Aug 3, 2024 07:1321,5153,308,217,9103,227,286,309016,908,288
9Aug 3, 2024 07:1321,7693,324,990,6753,265,281,274016,916,480