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:09M-RochatM-RochatScore: 4,177Success
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:104,164636,669,826603,206,00021,539,00016,793,600
2May 17, 2026 04:104,168636,540,372603,962,00021,373,00016,793,600
3May 17, 2026 04:104,171636,553,739604,186,00021,607,00016,793,600
4May 17, 2026 04:104,175637,666,100604,722,00021,549,00016,793,600
5May 17, 2026 04:104,177635,429,871605,260,00021,338,00016,793,600
6May 17, 2026 04:104,177636,082,542605,194,00021,435,00016,793,600
7May 17, 2026 04:104,180639,165,880605,288,00021,778,00016,793,600
8May 17, 2026 04:104,181637,313,877605,735,00021,448,00016,793,600
9May 17, 2026 04:104,184637,487,136606,171,00021,495,00016,793,600