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 listMay 13, 2026 22:40Aleksei ShahoikaAleksei ShahoikaScore: 3,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 22:413,318507,368,813492,112,0005,688,00016,797,696
2May 13, 2026 22:413,321508,271,512492,485,0005,711,00016,797,696
3May 13, 2026 22:413,323507,340,645492,758,0005,776,00016,797,696
4May 13, 2026 22:413,325509,820,871493,061,0005,774,00016,797,696
5May 13, 2026 22:413,327509,013,622493,403,0005,721,00016,797,696
6May 13, 2026 22:413,329510,298,542493,825,0005,647,00016,797,696
7May 13, 2026 22:413,330508,460,862493,704,0005,827,00016,797,696
8May 13, 2026 22:413,341512,804,148495,466,0005,775,00016,797,696
9May 13, 2026 22:413,348510,945,608496,494,0005,726,00016,797,696