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 listAug 30, 2026 20:57Victor MerckléVictor MerckléScore: 1,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:591,579246,773,697232,732,0004,185,00016,797,696stderr
2Aug 30, 2026 20:591,580247,285,840232,873,0004,234,00016,797,696stderr
3Aug 30, 2026 20:591,581247,880,504233,007,0004,275,00016,797,696stderr
4Aug 30, 2026 20:591,582247,667,720233,082,0004,279,00016,797,696stderr
5Aug 30, 2026 20:591,582247,440,364233,164,0004,273,00016,797,696stderr
6Aug 30, 2026 20:591,583247,620,829233,193,0004,383,00016,797,696stderr
7Aug 30, 2026 20:591,583247,764,392233,264,0004,298,00016,797,696stderr
8Aug 30, 2026 20:591,585248,091,543233,549,0004,320,00016,797,696stderr
9Aug 30, 2026 20:591,586248,679,341233,520,0004,465,00016,797,696stderr