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 16:41Victor MerckléVictor MerckléScore: 1,665Success
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 16:421,662258,577,189241,699,0007,688,00016,797,696
2Jun 17, 2026 16:421,662258,559,928241,707,0007,719,00016,797,696
3Jun 17, 2026 16:421,664258,844,080241,964,0007,729,00016,797,696
4Jun 17, 2026 16:421,664258,837,305242,036,0007,688,00016,797,696
5Jun 17, 2026 16:421,665258,975,205241,895,0007,894,00016,797,696
6Jun 17, 2026 16:421,665259,379,698242,016,0007,779,00016,797,696
7Jun 17, 2026 16:421,669259,518,505242,662,0007,809,00016,797,696
8Jun 17, 2026 16:421,670259,682,685242,740,0007,813,00016,797,696
9Jun 17, 2026 16:421,670259,712,873242,776,0007,802,00016,797,696