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 20, 2026 17:16M-RochatM-RochatScore: 4,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:164,170637,430,668604,216,00021,385,00016,793,600
2May 20, 2026 17:164,177637,770,828605,150,00021,424,00016,793,600
3May 20, 2026 17:164,179638,020,191605,583,00021,374,00016,793,600
4May 20, 2026 17:164,182637,269,739606,096,00021,252,00016,793,600
5May 20, 2026 17:164,185637,793,582606,405,00021,357,00016,793,600
6May 20, 2026 17:164,185639,486,797606,478,00021,317,00016,793,600
7May 20, 2026 17:164,190638,062,202607,356,00021,200,00016,793,600
8May 20, 2026 17:164,191638,148,136606,881,00021,851,00016,793,600
9May 20, 2026 17:164,201639,697,680608,158,00022,057,00016,793,600