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 14:32Kevin HeaveyKevin HeaveyScore: 1,588Success
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 14:331,585247,213,470232,850,0005,003,00016,793,600
2Sep 26, 2026 14:331,586247,454,210232,935,0005,079,00016,793,600
3Sep 26, 2026 14:331,586246,896,113232,999,0005,037,00016,793,600
4Sep 26, 2026 14:331,586246,838,108232,996,0005,029,00016,793,600
5Sep 26, 2026 14:331,588247,034,352233,243,0005,019,00016,793,600
6Sep 26, 2026 14:331,589247,816,830233,306,0005,065,00016,793,600
7Sep 26, 2026 14:331,592248,260,646233,786,0005,101,00016,793,600
8Sep 26, 2026 14:331,592248,279,958233,823,0005,097,00016,793,600
9Sep 26, 2026 14:331,592248,983,264233,776,0005,101,00016,793,600