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 listMar 25, 2023 12:57Sergey StreminSergey StreminScore: 10,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 12:5710,7291,691,275,5511,609,386,047016,990,208
2Mar 25, 2023 12:5710,7441,689,310,2801,611,633,106016,994,304
3Mar 25, 2023 12:5710,7681,691,069,4241,615,188,335016,990,208
4Mar 25, 2023 12:5710,7681,677,042,1501,615,161,580016,990,208
5Mar 25, 2023 12:5710,7721,687,227,2391,615,799,852016,986,112
6Mar 25, 2023 12:5710,7881,702,899,3581,618,125,900017,002,496