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: 16,126Success
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:3316,1172,428,395,7422,404,560,00013,074,00016,793,600
2Oct 21, 2026 05:3316,1182,428,606,4472,404,744,00013,022,00016,793,600
3Oct 21, 2026 05:3316,1192,428,618,0752,404,912,00012,940,00016,793,600
4Oct 21, 2026 05:3316,1202,429,172,4552,405,077,00013,069,00016,793,600
5Oct 21, 2026 05:3316,1262,429,821,0822,406,022,00012,997,00016,793,600
6Oct 21, 2026 05:3316,1262,430,013,8062,405,501,00013,416,00016,793,600
7Oct 21, 2026 05:3316,1272,429,902,0772,406,063,00012,988,00016,793,600
8Oct 21, 2026 05:3316,1322,431,174,3712,406,700,00013,240,00016,793,600
9Oct 21, 2026 05:3316,1392,439,815,1882,407,845,00013,047,00016,793,600