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 21, 2026 17:58A_ShamanA_ShamanScore: 4,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:584,138630,719,059597,703,00023,142,00016,809,984
2Jun 21, 2026 17:584,145631,476,514598,709,00023,134,00016,809,984
3Jun 21, 2026 17:584,145631,412,999597,654,00024,143,00016,809,984
4Jun 21, 2026 17:584,146631,920,145598,561,00023,372,00016,809,984
5Jun 21, 2026 17:584,148632,085,009598,022,00024,264,00016,809,984
6Jun 21, 2026 17:584,149632,109,161599,304,00023,186,00016,809,984
7Jun 21, 2026 17:584,150632,221,526598,935,00023,598,00016,809,984
8Jun 21, 2026 17:584,158633,697,131600,180,00023,526,00016,809,984
9Jun 21, 2026 17:584,236644,951,852611,836,00023,652,00016,818,176