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 listMar 22, 2026 19:22Dominique GarmierDominique GarmierScore: 88,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 17:0188,24613,268,416,17413,213,981,00022,987,00017,084,416
2Mar 22, 2026 17:0188,27013,286,798,18113,215,452,00024,985,00017,174,528
3Mar 22, 2026 17:0188,27713,275,644,04413,215,506,00025,987,00017,145,856
4Mar 22, 2026 19:2288,37313,308,602,28813,235,018,00020,987,00017,178,624
5Mar 22, 2026 19:2288,72713,383,304,04913,281,102,00027,977,00017,231,872
6Mar 22, 2026 19:2288,95313,391,050,67213,314,927,00027,976,00017,113,088