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 20, 2026 16:59M-RochatM-RochatScore: 6,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:006,9771,057,502,6571,039,384,0007,273,00016,793,600
2May 20, 2026 17:006,9771,055,955,1101,039,260,0007,350,00016,793,600
3May 20, 2026 17:006,9831,058,659,9221,039,959,0007,494,00016,793,600
4May 20, 2026 17:006,9841,058,879,9811,040,263,0007,458,00016,793,600
5May 20, 2026 17:006,9851,060,105,8161,040,481,0007,315,00016,793,600
6May 20, 2026 17:006,9851,059,218,8241,040,393,0007,383,00016,793,600
7May 20, 2026 17:006,9901,060,065,5111,041,196,0007,380,00016,793,600
8May 20, 2026 17:006,9921,059,930,0801,041,597,0007,298,00016,793,600
9May 20, 2026 17:006,9961,061,026,9091,042,124,0007,310,00016,793,600