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 listJul 31, 2026 06:15TonyTonyScore: 57,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 06:2955,3378,311,326,4598,255,361,00045,236,00016,793,600
2Jul 31, 2026 06:2957,3298,609,473,3428,559,771,00039,654,00016,793,600
3Jul 31, 2026 06:2957,4048,622,030,8268,570,246,00040,394,00016,793,600