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:52M-RochatM-RochatScore: 4,758Success
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:534,745720,983,418690,544,00021,221,00016,793,600
2May 22, 2026 22:534,746724,061,342690,876,00021,082,00016,793,600
3May 22, 2026 22:534,748723,541,537690,150,00022,096,00016,793,600
4May 22, 2026 22:534,757725,394,208692,470,00021,199,00016,793,600
5May 22, 2026 22:534,758723,116,421692,383,00021,408,00016,793,600
6May 22, 2026 22:534,762724,778,973692,967,00021,405,00016,793,600
7May 22, 2026 22:534,762725,730,929693,037,00021,330,00016,793,600
8May 22, 2026 22:534,936752,881,196719,742,00020,703,00016,793,600
9May 22, 2026 22:534,979759,127,865725,826,00021,050,00016,793,600