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 24, 2026 14:38anboto1anboto1Score: 3,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 14:393,102474,453,994440,067,00025,340,00016,793,600
2Jun 24, 2026 14:393,105474,889,852440,231,00025,580,00016,793,600
3Jun 24, 2026 14:393,105474,974,165441,130,00024,630,00016,793,600
4Jun 24, 2026 14:393,107475,248,693440,393,00025,713,00016,793,600
5Jun 24, 2026 14:393,108475,294,424440,941,00025,260,00016,793,600
6Jun 24, 2026 14:393,112476,055,801441,021,00025,855,00016,793,600
7Jun 24, 2026 14:393,115476,523,540442,407,00024,960,00016,793,600
8Jun 24, 2026 14:393,121477,869,281442,021,00026,143,00016,793,600
9Jun 24, 2026 14:393,123477,721,712442,755,00025,837,00016,793,600