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 12, 2026 06:36Victor MerckléVictor MerckléScore: 1,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 06:371,697263,800,109247,060,0007,636,00016,797,696
2Jun 12, 2026 06:371,699263,928,599247,208,0007,654,00016,797,696
3Jun 12, 2026 06:371,699264,063,886247,189,0007,711,00016,797,696
4Jun 12, 2026 06:371,699264,094,950247,073,0007,885,00016,797,696
5Jun 12, 2026 06:371,700264,142,162247,175,0007,862,00016,797,696
6Jun 12, 2026 06:371,700265,385,877247,203,0007,821,00016,797,696
7Jun 12, 2026 06:371,703264,660,115247,856,0007,725,00016,797,696
8Jun 12, 2026 06:371,705265,256,703248,016,0007,758,00016,797,696
9Jun 12, 2026 06:371,706265,072,304248,107,0007,809,00016,797,696