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:52M-RochatM-RochatScore: 4,334Success
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:524,313658,128,113625,755,00021,304,00016,793,600
2May 22, 2026 17:524,322661,851,206627,134,00021,285,00016,793,600
3May 22, 2026 17:524,325658,140,050627,395,00021,376,00016,793,600
4May 22, 2026 17:524,331660,698,970628,381,00021,381,00016,793,600
5May 22, 2026 17:524,334660,141,351628,402,00021,780,00016,793,600
6May 22, 2026 17:524,336660,563,031629,304,00021,107,00016,793,600
7May 22, 2026 17:524,336660,581,169629,424,00021,040,00016,793,600
8May 22, 2026 17:524,378668,077,915635,687,00021,080,00016,793,600
9May 22, 2026 17:524,382668,518,689636,359,00021,021,00016,793,600