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 5, 2026 00:53Victor MerckléVictor MerckléScore: 1,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 00:541,823282,707,928266,547,0006,993,00016,797,696
2Jun 5, 2026 00:541,823282,954,211266,408,0007,176,00016,797,696
3Jun 5, 2026 00:541,824282,782,350266,667,0006,990,00016,797,696
4Jun 5, 2026 00:541,824282,860,012266,491,0007,171,00016,797,696
5Jun 5, 2026 00:541,825283,037,811266,813,0007,071,00016,797,696
6Jun 5, 2026 00:541,827283,295,770267,132,0006,999,00016,797,696
7Jun 5, 2026 00:541,830283,583,651267,436,0007,108,00016,797,696
8Jun 5, 2026 00:541,830283,591,012267,516,0007,006,00016,797,696
9Jun 5, 2026 00:541,830284,484,710267,564,0007,047,00016,797,696