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 listJun 18, 2026 02:32Victor MerckléVictor MerckléScore: 1,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 02:331,655257,513,559240,558,0007,826,00016,797,696
2Jun 18, 2026 02:331,655257,538,624240,531,0007,838,00016,797,696
3Jun 18, 2026 02:331,656257,641,654240,671,0007,859,00016,797,696
4Jun 18, 2026 02:331,656257,533,182240,635,0007,802,00016,797,696
5Jun 18, 2026 02:331,657257,709,703240,712,0007,886,00016,797,696
6Jun 18, 2026 02:331,658257,870,484240,780,0007,958,00016,797,696
7Jun 18, 2026 02:331,661258,406,385241,343,0007,939,00016,797,696
8Jun 18, 2026 02:331,663258,631,579241,588,0007,968,00016,797,696
9Jun 18, 2026 02:331,664258,826,721241,596,0008,034,00016,797,696