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 listMay 22, 2026 17:54M-RochatM-RochatScore: 4,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 17:544,129630,793,893598,055,00021,327,00016,793,600
2May 22, 2026 17:544,130631,823,866598,236,00021,328,00016,793,600
3May 22, 2026 17:544,130629,639,746598,179,00021,352,00016,793,600
4May 22, 2026 17:544,131630,877,334598,455,00021,225,00016,793,600
5May 22, 2026 17:544,134630,378,999598,742,00021,475,00016,793,600
6May 22, 2026 17:544,137630,006,382599,416,00021,271,00016,793,600
7May 22, 2026 17:544,158634,893,221602,735,00021,069,00016,793,600
8May 22, 2026 17:544,182637,989,155606,691,00020,709,00016,793,600
9May 22, 2026 17:544,208643,516,557610,183,00021,095,00016,793,600