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 listSep 15, 2026 23:44Josu San MartinJosu San MartinScore: 3,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 23:463,203489,217,193460,936,00019,590,00016,797,696
2Sep 15, 2026 23:463,204489,457,222460,967,00019,646,00016,797,696
3Sep 15, 2026 23:463,208489,864,341461,753,00019,451,00016,797,696
4Sep 15, 2026 23:463,211490,495,635462,539,00019,205,00016,797,696
5Sep 15, 2026 23:463,211490,558,079461,852,00019,811,00016,797,696
6Sep 15, 2026 23:463,216491,096,985462,355,00020,170,00016,797,696
7Sep 15, 2026 23:463,217491,342,589463,187,00019,433,00016,797,696
8Sep 15, 2026 23:463,223492,340,211463,080,00020,459,00016,797,696
9Sep 15, 2026 23:463,224492,312,806463,444,00020,189,00016,797,696