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 22, 2026 17:47M-RochatM-RochatScore: 4,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 17:484,223643,529,638612,210,00021,296,00016,793,600
2May 22, 2026 17:484,224646,045,581612,382,00021,338,00016,793,600
3May 22, 2026 17:484,224644,867,475612,207,00021,538,00016,793,600
4May 22, 2026 17:484,230644,123,632613,239,00021,302,00016,793,600
5May 22, 2026 17:484,230643,858,806613,239,00021,298,00016,793,600
6May 22, 2026 17:484,232644,080,541613,581,00021,302,00016,793,600
7May 22, 2026 17:484,246649,198,516615,915,00020,987,00016,793,600
8May 22, 2026 17:484,256647,736,014617,292,00021,115,00016,793,600
9May 22, 2026 17:484,284655,007,195621,168,00021,541,00016,793,600