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 18, 2026 19:58Victor MerckléVictor MerckléScore: 1,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 19:591,649256,563,964239,675,0007,803,00016,797,696
2Jun 18, 2026 19:591,649256,504,242239,526,0007,860,00016,797,696
3Jun 18, 2026 19:591,649256,556,769239,571,0007,853,00016,797,696
4Jun 18, 2026 19:591,650256,742,912239,709,0007,877,00016,797,696
5Jun 18, 2026 19:591,650256,722,815239,612,0007,941,00016,797,696
6Jun 18, 2026 19:591,651256,905,840239,839,0007,940,00016,797,696
7Jun 18, 2026 19:591,654257,367,277240,301,0007,927,00016,797,696
8Jun 18, 2026 19:591,656257,534,329240,507,0007,977,00016,797,696
9Jun 18, 2026 19:591,657257,806,135240,667,0007,988,00016,797,696