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 06:11e1011e1011Score: 56,236Success
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 06:1556,1978,440,645,7238,412,751,00016,907,00016,793,600
2Oct 21, 2026 06:1556,1998,441,090,4678,412,214,00017,691,00016,793,600
3Oct 21, 2026 06:1556,1998,441,057,8558,412,063,00017,802,00016,793,600
4Oct 21, 2026 06:1556,2338,447,603,1918,417,761,00017,258,00016,793,600
5Oct 21, 2026 06:1556,2368,446,403,2558,418,420,00017,008,00016,793,600
6Oct 21, 2026 06:1556,2378,446,567,0508,418,767,00016,904,00016,793,600
7Oct 21, 2026 06:1556,2378,446,433,9918,418,685,00016,883,00016,793,600
8Oct 21, 2026 06:1556,2378,446,490,0248,418,435,00017,150,00016,793,600
9Oct 21, 2026 06:1556,2478,448,154,4518,419,465,00017,724,00016,793,600