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 19, 2026 12:26Victor MerckléVictor MerckléScore: 1,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 12:281,654257,498,019240,432,0007,811,00016,797,696
2Jun 19, 2026 12:281,655258,589,510240,411,0007,889,00016,797,696
3Jun 19, 2026 12:281,656257,704,272240,663,0007,877,00016,797,696
4Jun 19, 2026 12:281,656257,574,318240,659,0007,822,00016,797,696
5Jun 19, 2026 12:281,656257,567,295240,578,0007,861,00016,797,696
6Jun 19, 2026 12:281,657257,713,229240,748,0007,810,00016,797,696
7Jun 19, 2026 12:281,662258,528,110241,507,0007,915,00016,797,696
8Jun 19, 2026 12:281,662258,499,367241,339,0007,984,00016,797,696
9Jun 19, 2026 12:281,663258,608,828241,603,0007,910,00016,797,696