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 28, 2024 00:59Joad NacerJoad NacerScore: 4,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 00:594,323674,082,818609,529,00038,969,00017,162,240
2Dec 28, 2024 00:594,325670,873,803603,743,00044,980,00017,211,392
3Dec 28, 2024 00:594,332675,239,231605,863,00043,990,00017,047,552