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:06anboto1anboto1Score: 3,180Success
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:063,172485,065,160450,521,00025,338,00016,793,600
2Jun 24, 2026 12:063,175487,337,487450,629,00025,710,00016,793,600
3Jun 24, 2026 12:063,175485,526,817451,247,00025,147,00016,793,600
4Jun 24, 2026 12:063,178486,087,473451,360,00025,365,00016,793,600
5Jun 24, 2026 12:063,180486,250,709450,566,00026,451,00016,793,600
6Jun 24, 2026 12:063,180486,633,438451,000,00026,128,00016,793,600
7Jun 24, 2026 12:063,185487,074,421452,074,00025,727,00016,793,600
8Jun 24, 2026 12:063,186487,201,025452,400,00025,516,00016,793,600
9Jun 24, 2026 12:063,189487,604,757452,672,00025,770,00016,793,600