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 04:49M-RochatM-RochatScore: 4,495Success
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 04:494,455678,928,099647,187,00021,106,00016,793,600
2May 17, 2026 04:494,489684,386,497652,353,00021,042,00016,793,600
3May 17, 2026 04:494,491683,021,455652,561,00021,231,00016,793,600
4May 17, 2026 04:494,495683,813,680653,245,00021,097,00016,793,600
5May 17, 2026 04:494,495683,257,316653,104,00021,278,00016,793,600
6May 17, 2026 04:494,503687,316,423654,111,00021,342,00016,793,600
7May 17, 2026 04:494,507687,184,584654,732,00021,409,00016,793,600
8May 17, 2026 04:494,513686,342,854656,561,00020,512,00016,793,600
9May 17, 2026 04:494,726719,361,621687,551,00021,385,00016,793,600