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 00:48e1011e1011Score: 39,812Success
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 00:5039,7915,980,301,1765,958,913,0009,855,00016,793,600
2Oct 21, 2026 00:5039,7945,980,227,1185,959,755,0009,467,00016,793,600
3Oct 21, 2026 00:5039,8035,981,294,4595,960,926,0009,527,00016,793,600
4Oct 21, 2026 00:5039,8115,982,921,4255,961,829,0009,941,00016,793,600
5Oct 21, 2026 00:5039,8125,982,769,6425,962,356,0009,490,00016,793,600
6Oct 21, 2026 00:5039,8165,983,607,9625,962,506,0009,952,00016,793,600
7Oct 21, 2026 00:5039,8285,985,170,5265,964,801,0009,453,00016,793,600
8Oct 21, 2026 00:5039,8485,988,215,2605,967,967,0009,371,00016,793,600
9Oct 21, 2026 00:5039,8505,988,458,2115,967,996,0009,569,00016,793,600