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 16, 2026 16:09M-RochatM-RochatScore: 4,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 16:114,445677,590,088645,061,00021,772,00016,793,600
2May 16, 2026 16:114,452677,518,026646,576,00021,265,00016,793,600
3May 16, 2026 16:114,458680,023,978646,953,00021,758,00016,793,600
4May 16, 2026 16:114,458679,577,421647,291,00021,476,00016,793,600
5May 16, 2026 16:114,458679,672,065647,298,00021,471,00016,793,600
6May 16, 2026 16:114,462678,292,535647,960,00021,461,00016,793,600
7May 16, 2026 16:114,462678,718,714647,690,00021,632,00016,793,600
8May 16, 2026 16:114,466678,890,114648,333,00021,654,00016,793,600
9May 16, 2026 16:114,473682,735,254648,371,00022,657,00016,793,600