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 23:17M-RochatM-RochatScore: 4,068Success
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 23:184,050617,483,844585,167,00022,423,00016,793,600
2May 22, 2026 23:184,061621,984,599586,372,00022,902,00016,793,600
3May 22, 2026 23:184,062619,453,202585,252,00024,184,00016,793,600
4May 22, 2026 23:184,066620,047,727586,843,00023,123,00016,793,600
5May 22, 2026 23:184,068622,228,786587,140,00023,077,00016,793,600
6May 22, 2026 23:184,069621,129,766587,152,00023,281,00016,793,600
7May 22, 2026 23:184,071619,982,821587,577,00023,216,00016,793,600
8May 22, 2026 23:184,073622,544,401587,775,00023,263,00016,793,600
9May 22, 2026 23:184,081622,518,457588,733,00023,502,00016,793,600