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 listApr 26, 2026 18:24TudyMTudyMScore: 25,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 18:2425,3213,822,581,5313,771,236,00026,965,00017,104,896
2Apr 26, 2026 18:2425,5453,854,062,8723,805,855,00025,964,00016,998,400
3Apr 26, 2026 18:2425,6563,876,918,9303,819,474,00028,958,00016,998,400
4Apr 26, 2026 18:2425,7023,882,241,5563,825,468,00029,956,00016,998,400
5Apr 26, 2026 18:2425,7443,886,812,6923,831,685,00029,958,00016,998,400
6Apr 26, 2026 18:2425,8793,911,653,5613,852,046,00029,953,00016,998,400
7Apr 26, 2026 18:2425,8823,906,345,0783,855,418,00026,960,00017,068,032
8Apr 26, 2026 18:2425,8883,905,502,9293,857,245,00025,967,00016,998,400
9Apr 26, 2026 18:2425,9393,913,007,9973,866,943,00023,962,00016,998,400