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 listOct 17, 2026 07:25janwwwjanwwwScore: 1,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 07:271,730268,696,027251,720,0007,889,00016,793,600
2Oct 17, 2026 07:271,730268,474,947251,639,0007,895,00016,793,600
3Oct 17, 2026 07:271,731268,674,283251,721,0007,982,00016,793,600
4Oct 17, 2026 07:271,732270,577,166251,915,0007,901,00016,793,600
5Oct 17, 2026 07:271,732269,071,210251,996,0007,919,00016,793,600
6Oct 17, 2026 07:271,733276,284,057251,993,0007,981,00016,793,600
7Oct 17, 2026 07:271,733269,082,478252,210,0007,862,00016,793,600
8Oct 17, 2026 07:271,734269,253,619252,285,0007,844,00016,793,600
9Oct 17, 2026 07:271,734271,508,183252,176,0007,952,00016,793,600