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:08anboto1anboto1Score: 3,161Success
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:083,154482,466,416447,576,00025,633,00016,793,600
2Jun 24, 2026 12:083,154482,407,173447,645,00025,602,00016,793,600
3Jun 24, 2026 12:083,154482,517,003447,745,00025,498,00016,793,600
4Jun 24, 2026 12:083,160483,286,594448,359,00025,663,00016,793,600
5Jun 24, 2026 12:083,161483,521,653448,385,00025,853,00016,793,600
6Jun 24, 2026 12:083,168484,818,790449,306,00025,921,00016,793,600
7Jun 24, 2026 12:083,172484,996,225450,676,00025,269,00016,793,600
8Jun 24, 2026 12:083,173485,212,709451,047,00025,024,00016,793,600
9Jun 24, 2026 12:083,175485,392,514451,141,00025,112,00016,793,600