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 12, 2026 05:31Victor MerckléVictor MerckléScore: 1,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 05:321,713266,297,810249,399,0007,672,00016,797,696
2Jun 12, 2026 05:321,714266,293,451249,556,0007,674,00016,797,696
3Jun 12, 2026 05:321,714266,386,255249,564,0007,683,00016,797,696
4Jun 12, 2026 05:321,715266,404,195249,632,0007,712,00016,797,696
5Jun 12, 2026 05:321,715266,408,381249,623,0007,689,00016,797,696
6Jun 12, 2026 05:321,716266,599,988249,616,0007,832,00016,797,696
7Jun 12, 2026 05:321,720267,147,047250,357,0007,728,00016,797,696
8Jun 12, 2026 05:321,722267,426,141250,632,0007,764,00016,797,696
9Jun 12, 2026 05:321,722267,401,238250,557,0007,767,00016,797,696