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 15, 2026 14:32Victor MerckléVictor MerckléScore: 1,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 14:331,672258,668,042243,234,0007,682,00016,797,696
2Jun 15, 2026 14:331,672259,738,699243,226,0007,679,00016,797,696
3Jun 15, 2026 14:331,673258,740,275243,334,0007,701,00016,797,696
4Jun 15, 2026 14:331,673258,546,368243,266,0007,716,00016,797,696
5Jun 15, 2026 14:331,674258,873,675243,403,0007,803,00016,797,696
6Jun 15, 2026 14:331,674258,662,875243,316,0007,820,00016,797,696
7Jun 15, 2026 14:331,679259,607,598244,119,0007,758,00016,797,696
8Jun 15, 2026 14:331,679259,503,641244,152,0007,784,00016,797,696
9Jun 15, 2026 14:331,679259,405,552244,132,0007,832,00016,797,696