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 listSep 3, 2024 16:53AnSaAnSaScore: 13,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 16:5313,5232,057,800,6492,016,496,00011,973,00016,379,904
2Sep 3, 2024 16:5313,7202,090,507,6252,047,946,0009,980,00016,388,096
3Sep 3, 2024 16:5315,5722,370,724,5852,324,759,00010,975,00016,392,192