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:43M-RochatM-RochatScore: 4,129Success
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:444,124631,195,461597,404,00021,270,00016,793,600
2May 22, 2026 17:444,125629,724,098597,657,00021,234,00016,793,600
3May 22, 2026 17:444,125630,882,833597,563,00021,274,00016,793,600
4May 22, 2026 17:444,128631,480,032597,976,00021,268,00016,793,600
5May 22, 2026 17:444,129630,249,053598,216,00021,258,00016,793,600
6May 22, 2026 17:444,144632,884,999600,775,00020,959,00016,793,600
7May 22, 2026 17:444,149633,397,340601,230,00021,134,00016,793,600
8May 22, 2026 17:444,168636,756,363604,440,00020,891,00016,793,600
9May 22, 2026 17:444,174636,506,356602,497,00023,722,00016,793,600