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 listDec 27, 2023 10:31Oleg KovalovOleg KovalovScore: 363,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 18, 2023 14:09361,76554,333,279,64954,264,824,679016,961,536
2Dec 18, 2023 14:09363,63354,609,184,87354,544,930,532016,973,824
3Dec 18, 2023 14:09363,72154,629,878,69054,558,173,982016,961,536
4Dec 27, 2023 10:31363,84554,648,030,83154,576,821,854016,973,824
5Dec 27, 2023 10:31364,13654,699,619,89554,620,385,380016,965,632
6Dec 27, 2023 10:31365,40254,876,714,74754,810,264,356016,961,536