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 listMay 6, 2025 10:50KeefeKeefeScore: 8,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2025 10:508,7411,341,704,9021,240,260,00070,957,00017,162,240
2May 6, 2025 10:508,7511,341,239,9801,243,724,00068,984,00017,063,936
3May 6, 2025 10:508,7561,341,114,0621,227,503,00085,965,00017,002,496