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 17, 2026 15:25Victor MerckléVictor MerckléScore: 1,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:261,662258,898,010241,697,0007,713,00016,797,696
2Jun 17, 2026 15:261,662258,800,897241,753,0007,663,00016,797,696
3Jun 17, 2026 15:261,662258,839,597241,735,0007,686,00016,797,696
4Jun 17, 2026 15:261,663258,927,459241,830,0007,682,00016,797,696
5Jun 17, 2026 15:261,663258,855,404241,765,0007,712,00016,797,696
6Jun 17, 2026 15:261,664258,955,439241,994,0007,685,00016,797,696
7Jun 17, 2026 15:261,668259,515,008242,512,0007,771,00016,797,696
8Jun 17, 2026 15:261,669259,687,574242,663,0007,797,00016,797,696
9Jun 17, 2026 15:261,671259,949,451242,941,0007,837,00016,797,696