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 20, 2026 17:12M-RochatM-RochatScore: 4,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:134,146633,160,387599,599,00022,312,00016,793,600
2May 20, 2026 17:134,151632,713,698600,534,00022,229,00016,793,600
3May 20, 2026 17:134,152634,636,128600,555,00022,270,00016,793,600
4May 20, 2026 17:134,152634,004,344600,451,00022,387,00016,793,600
5May 20, 2026 17:134,156635,511,996601,462,00021,988,00016,793,600
6May 20, 2026 17:134,157635,470,946601,587,00022,035,00016,793,600
7May 20, 2026 17:134,158635,332,104601,494,00022,259,00016,793,600
8May 20, 2026 17:134,158634,189,437601,478,00022,282,00016,793,600
9May 20, 2026 17:134,181638,705,460605,162,00022,002,00016,793,600