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 listNov 21, 2023 08:08mmalczakmmalczakScore: 11,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2023 08:0911,5511,796,862,7971,732,689,123017,002,496
2Nov 21, 2023 08:0911,5901,802,618,4441,738,573,775016,998,400
3Nov 21, 2023 08:0911,6151,822,485,3121,742,296,598016,998,400
4Nov 21, 2023 08:0811,7371,840,322,9681,760,619,861017,002,496
5Nov 21, 2023 08:0811,7691,826,263,7851,765,308,632016,998,400
6Nov 21, 2023 08:0811,8731,852,312,8121,780,897,433016,998,400