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 12:31anboto1anboto1Score: 3,155Success
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 12:313,150481,600,718447,472,00025,050,00016,793,600
2Jun 24, 2026 12:313,152481,944,575448,222,00024,601,00016,793,600
3Jun 24, 2026 12:313,153482,235,677447,668,00025,420,00016,793,600
4Jun 24, 2026 12:313,154482,284,571448,723,00024,476,00016,793,600
5Jun 24, 2026 12:313,155482,394,818448,533,00024,739,00016,793,600
6Jun 24, 2026 12:313,157482,889,239447,919,00025,766,00016,793,600
7Jun 24, 2026 12:313,168484,434,759451,032,00024,291,00016,793,600
8Jun 24, 2026 12:313,171484,881,365451,180,00024,549,00016,793,600
9Jun 24, 2026 12:313,172485,061,903450,469,00025,421,00016,793,600