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 listJul 29, 2026 15:42anboto1anboto1Score: 2,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 15:432,946450,503,446434,587,0007,339,00016,797,696
2Jul 29, 2026 15:432,947450,626,308434,786,0007,272,00016,797,696
3Jul 29, 2026 15:432,948450,936,578434,881,0007,430,00016,797,696
4Jul 29, 2026 15:432,949452,303,792435,124,0007,323,00016,797,696
5Jul 29, 2026 15:432,951451,179,405435,369,0007,327,00016,797,696
6Jul 29, 2026 15:432,952451,434,424435,459,0007,372,00016,801,792
7Jul 29, 2026 15:432,952451,394,160435,360,0007,461,00016,797,696
8Jul 29, 2026 15:432,957452,620,251436,725,0006,953,00016,797,696
9Jul 29, 2026 15:432,960452,628,001437,163,0006,952,00016,797,696