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 01:12e1011e1011Score: 19,415Success
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 01:1319,3302,910,475,1172,878,210,00021,301,00016,793,600
2Oct 21, 2026 01:1319,3632,915,568,3162,882,546,00022,009,00016,793,600
3Oct 21, 2026 01:1319,3782,917,736,5042,885,204,00021,519,00016,793,600
4Oct 21, 2026 01:1319,3832,918,350,0472,885,773,00021,695,00016,793,600
5Oct 21, 2026 01:1319,4152,923,228,8332,890,932,00021,398,00016,793,600
6Oct 21, 2026 01:1319,4652,932,581,2012,897,613,00022,272,00016,793,600
7Oct 21, 2026 01:1319,4962,935,306,9362,902,433,00021,973,00016,793,600
8Oct 21, 2026 01:1319,5072,937,009,1722,903,599,00022,501,00016,793,600
9Oct 21, 2026 01:1319,5242,939,527,6522,907,026,00021,681,00016,793,600