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 30, 2026 03:54Elijah KinElijah KinScore: 7,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:557,6901,163,967,4571,128,421,00025,219,00016,793,600
2May 30, 2026 03:557,7151,166,976,0951,132,726,00024,636,00016,793,600
3May 30, 2026 03:557,7181,170,298,4361,133,047,00024,693,00016,793,600
4May 30, 2026 03:557,7271,170,289,9251,134,519,00024,663,00016,793,600
5May 30, 2026 03:557,7281,169,169,0721,134,972,00024,375,00016,793,600
6May 30, 2026 03:557,7301,169,679,5501,134,839,00024,676,00016,793,600
7May 30, 2026 03:557,7381,171,124,5661,136,494,00024,318,00016,793,600
8May 30, 2026 03:557,7901,180,676,4591,144,066,00024,578,00016,793,600
9May 30, 2026 03:557,8941,194,521,2281,159,310,00024,812,00016,793,600