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 03:58e1011e1011Score: 16,198Success
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 04:0616,1852,438,904,2882,410,913,00016,901,00016,793,600
2Oct 21, 2026 04:0616,1942,440,069,1042,412,239,00016,998,00016,793,600
3Oct 21, 2026 04:0616,1952,440,166,0562,412,366,00016,963,00016,793,600
4Oct 21, 2026 04:0616,1982,440,671,4752,412,746,00017,028,00016,793,600
5Oct 21, 2026 04:0616,1982,440,517,0162,412,759,00016,979,00016,793,600
6Oct 21, 2026 04:0616,1982,440,991,8012,412,766,00017,083,00016,793,600
7Oct 21, 2026 04:0616,1992,442,477,8732,413,011,00016,978,00016,793,600
8Oct 21, 2026 04:0616,2052,441,979,8752,413,842,00017,025,00016,793,600
9Oct 21, 2026 04:0616,2122,442,978,2192,414,910,00017,012,00016,793,600