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 17, 2026 00:25Aleksei ShahoikaAleksei ShahoikaScore: 1,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 00:261,980307,605,895291,452,0005,658,00016,797,696
2May 17, 2026 00:261,984308,226,711292,197,0005,509,00016,797,696
3May 17, 2026 00:261,986307,329,588292,552,0005,388,00016,797,696
4May 17, 2026 00:261,987309,088,171292,461,0005,696,00016,797,696
5May 17, 2026 00:261,988309,021,484292,752,0005,585,00016,797,696
6May 17, 2026 00:261,992307,701,108293,589,0005,358,00016,797,696
7May 17, 2026 00:261,996309,814,437293,853,0005,650,00016,797,696
8May 17, 2026 00:261,996309,969,864293,977,0005,458,00016,797,696
9May 17, 2026 00:261,997311,041,631294,123,0005,571,00016,797,696