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:38M-RochatM-RochatScore: 4,130Success
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:384,124629,772,434597,457,00021,246,00016,793,600
2May 22, 2026 17:384,127629,251,459597,806,00021,379,00016,793,600
3May 22, 2026 17:384,129630,405,544598,139,00021,223,00016,793,600
4May 22, 2026 17:384,130629,004,335598,056,00021,515,00016,793,600
5May 22, 2026 17:384,130630,722,686598,036,00021,483,00016,793,600
6May 22, 2026 17:384,143633,668,219600,516,00021,070,00016,793,600
7May 22, 2026 17:384,178638,674,699606,061,00020,707,00016,793,600
8May 22, 2026 17:384,202641,682,920609,643,00020,707,00016,793,600
9May 22, 2026 17:384,254648,469,804617,075,00021,136,00016,793,600