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 listSep 26, 2026 18:20Kevin HeaveyKevin HeaveyScore: 1,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 18:211,556242,091,943228,795,0004,673,00016,793,600
2Sep 26, 2026 18:211,557242,300,307228,981,0004,686,00016,793,600
3Sep 26, 2026 18:211,557241,984,613228,848,0004,704,00016,793,600
4Sep 26, 2026 18:211,558242,415,402229,135,0004,634,00016,793,600
5Sep 26, 2026 18:211,559242,602,163229,243,0004,692,00016,793,600
6Sep 26, 2026 18:211,560242,708,789229,337,0004,726,00016,793,600
7Sep 26, 2026 18:211,560242,556,092229,441,0004,677,00016,793,600
8Sep 26, 2026 18:211,561242,928,208229,444,0004,732,00016,793,600
9Sep 26, 2026 18:211,565243,998,444230,098,0004,725,00016,793,600