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 03:47e1011e1011Score: 24,017Success
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 03:4824,0023,611,163,7723,578,431,00021,886,00016,793,600
2Oct 21, 2026 03:4824,0063,611,772,3603,579,064,00021,844,00016,793,600
3Oct 21, 2026 03:4824,0103,612,404,6653,579,788,00021,713,00016,793,600
4Oct 21, 2026 03:4824,0153,613,269,7863,580,737,00021,571,00016,793,600
5Oct 21, 2026 03:4824,0173,613,445,6793,580,822,00021,786,00016,793,600
6Oct 21, 2026 03:4824,2463,647,952,6973,613,138,00023,801,00016,793,600
7Oct 21, 2026 03:4824,2583,649,815,0863,614,983,00023,832,00016,793,600
8Oct 21, 2026 03:4824,2833,653,818,7803,618,016,00024,497,00016,793,600
9Oct 21, 2026 03:4824,2863,654,218,3583,618,648,00024,373,00016,793,600