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 17, 2026 23:09M-RochatM-RochatScore: 23,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 23:1023,2203,494,223,0353,457,906,00025,216,00016,793,600
2May 17, 2026 23:1023,2513,499,396,5573,461,596,00026,162,00016,793,600
3May 17, 2026 23:1023,3053,506,059,7153,470,890,00025,004,00016,793,600
4May 17, 2026 23:1023,3153,508,718,3703,472,396,00025,002,00016,793,600
5May 17, 2026 23:1023,3193,509,190,0613,472,905,00024,988,00016,793,600
6May 17, 2026 23:1023,3913,517,922,2163,482,488,00026,190,00016,793,600
7May 17, 2026 23:1023,5093,536,281,8753,501,399,00025,036,00016,793,600
8May 17, 2026 23:1023,5643,544,736,7713,509,603,00025,089,00016,793,600
9May 17, 2026 23:1023,6173,553,750,8153,517,633,00024,926,00016,793,600