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 20, 2026 17:11M-RochatM-RochatScore: 4,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:124,121628,059,612597,000,00021,293,00016,793,600
2May 20, 2026 17:124,124628,011,077597,367,00021,334,00016,793,600
3May 20, 2026 17:124,124628,897,812597,364,00021,322,00016,793,600
4May 20, 2026 17:124,125631,340,577597,576,00021,274,00016,793,600
5May 20, 2026 17:124,127629,276,418597,916,00021,268,00016,793,600
6May 20, 2026 17:124,129631,043,669597,823,00021,542,00016,793,600
7May 20, 2026 17:124,130628,835,370597,171,00022,340,00016,793,600
8May 20, 2026 17:124,145632,038,608600,623,00021,187,00016,793,600
9May 20, 2026 17:124,178638,859,723605,978,00020,749,00016,793,600