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:55KeefeKeefeScore: 4,704Success
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:554,691731,934,813692,620,00010,993,00016,953,344
2May 6, 2025 10:554,693734,177,284692,965,00010,999,00017,039,360
3May 6, 2025 10:554,700733,702,714695,966,0008,999,00017,174,528
4May 6, 2025 10:554,703732,815,715695,489,0009,992,00017,149,952
5May 6, 2025 10:554,704733,977,283694,548,00010,992,00016,953,344
6May 6, 2025 10:554,704734,153,154695,665,0009,995,00016,953,344
7May 6, 2025 10:554,709731,682,159694,408,00011,989,00017,027,072
8May 6, 2025 10:554,710736,346,837697,503,0008,993,00016,953,344
9May 6, 2025 10:554,712734,707,213696,865,0009,998,00017,031,168