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 16, 2026 16:16M-RochatM-RochatScore: 4,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 16:184,481681,155,309650,926,00021,337,00016,793,600
2May 16, 2026 16:184,485681,671,365651,093,00021,767,00016,793,600
3May 16, 2026 16:184,487682,135,973651,718,00021,387,00016,793,600
4May 16, 2026 16:184,493683,749,365652,261,00021,719,00016,793,600
5May 16, 2026 16:184,497684,555,122652,964,00021,684,00016,793,600
6May 16, 2026 16:184,497684,329,827653,127,00021,494,00016,793,600
7May 16, 2026 16:184,499684,257,135653,548,00021,360,00016,793,600
8May 16, 2026 16:184,527689,329,729657,700,00021,405,00016,793,600
9May 16, 2026 16:184,625704,844,142672,799,00021,033,00016,793,600