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 22:49M-RochatM-RochatScore: 4,651Success
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 22:504,501684,828,316645,523,00029,753,00016,793,600
2May 22, 2026 22:504,508688,085,460647,360,00028,939,00016,793,600
3May 22, 2026 22:504,513688,479,548647,888,00029,139,00016,793,600
4May 22, 2026 22:504,643706,180,616667,014,00029,461,00016,793,600
5May 22, 2026 22:504,651707,497,859668,254,00029,537,00016,793,600
6May 22, 2026 22:504,656709,602,635668,894,00029,585,00016,793,600
7May 22, 2026 22:504,678713,057,021671,966,00029,860,00016,793,600
8May 22, 2026 22:504,686714,109,298673,388,00029,591,00016,793,600
9May 22, 2026 22:504,688714,033,069673,527,00029,771,00016,793,600