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 listSep 15, 2026 15:59Haha ExpertHaha ExpertScore: 4,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 16:004,664710,050,431690,228,0009,471,00016,793,600
2Sep 15, 2026 16:004,664710,041,199690,262,0009,449,00016,793,600
3Sep 15, 2026 16:004,665710,135,244690,441,0009,434,00016,793,600
4Sep 15, 2026 16:004,667710,374,960690,674,0009,423,00016,793,600
5Sep 15, 2026 16:004,668710,602,239690,848,0009,483,00016,793,600
6Sep 15, 2026 16:004,672711,228,960691,201,0009,628,00016,793,600
7Sep 15, 2026 16:004,676711,783,955691,684,0009,716,00016,793,600
8Sep 15, 2026 16:004,685713,056,505693,269,0009,500,00016,793,600
9Sep 15, 2026 16:004,698715,203,836695,223,0009,525,00016,793,600