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 07:07Victor MerckléVictor MerckléScore: 1,691Success
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 07:081,690262,772,640245,852,0007,794,00016,797,696
2Jun 12, 2026 07:081,690262,787,324245,932,0007,707,00016,797,696
3Jun 12, 2026 07:081,690262,698,331245,875,0007,644,00016,797,696
4Jun 12, 2026 07:081,690262,759,830245,832,0007,785,00016,797,696
5Jun 12, 2026 07:081,691262,953,717245,939,0007,768,00016,797,696
6Jun 12, 2026 07:081,692263,436,269246,099,0007,781,00016,797,696
7Jun 12, 2026 07:081,695263,436,181246,657,0007,730,00016,797,696
8Jun 12, 2026 07:081,695263,436,116246,578,0007,711,00016,797,696
9Jun 12, 2026 07:081,697263,673,293246,755,0007,835,00016,797,696