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 21, 2026 05:23e1011e1011Score: 15,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 05:2415,8142,383,017,8752,356,049,00016,161,00016,793,600
2Oct 21, 2026 05:2415,8152,383,735,4522,356,222,00016,132,00016,793,600
3Oct 21, 2026 05:2415,8172,384,224,2602,356,337,00016,287,00016,793,600
4Oct 21, 2026 05:2415,8202,384,091,2392,356,805,00016,324,00016,793,600
5Oct 21, 2026 05:2415,8212,386,090,1852,356,767,00016,399,00016,793,600
6Oct 21, 2026 05:2415,8252,385,225,8052,357,627,00016,194,00016,793,600
7Oct 21, 2026 05:2415,8282,385,235,9032,358,170,00016,167,00016,793,600
8Oct 21, 2026 05:2415,8342,386,029,4452,358,965,00016,141,00016,793,600
9Oct 21, 2026 05:2415,8362,386,691,2732,359,142,00016,305,00016,793,600