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 15:18anboto1anboto1Score: 3,011Success
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 15:193,005460,010,425438,754,00012,085,00016,793,600
2Jun 24, 2026 15:193,007460,483,271439,110,00012,073,00016,793,600
3Jun 24, 2026 15:193,010460,805,541439,887,00011,719,00016,793,600
4Jun 24, 2026 15:193,011460,881,149439,440,00012,303,00016,793,600
5Jun 24, 2026 15:193,011460,822,365439,887,00011,865,00016,793,600
6Jun 24, 2026 15:193,014461,315,285439,958,00012,222,00016,793,600
7Jun 24, 2026 15:193,076470,870,518450,036,00011,464,00016,793,600
8Jun 24, 2026 15:193,196488,827,864467,683,00011,859,00016,793,600
9Jun 24, 2026 15:194,027613,433,608592,273,00011,880,00016,793,600