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 listMay 1, 2026 08:21Dominique GarmierDominique GarmierScore: 3,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 08:223,224504,710,039455,764,00027,985,00017,145,856
2May 1, 2026 08:223,227503,541,955461,155,00023,007,00017,137,664
3May 1, 2026 08:223,228501,914,994457,362,00026,962,00017,100,800
4May 1, 2026 08:223,230508,600,445464,597,00019,982,00017,154,048
5May 1, 2026 08:223,230503,541,930458,629,00025,978,00017,215,488
6May 1, 2026 08:223,231504,815,521457,719,00026,983,00017,149,952
7May 1, 2026 08:223,232502,427,266462,866,00021,993,00017,145,856
8May 1, 2026 08:223,233499,529,120460,045,00025,002,00017,145,856
9May 1, 2026 08:223,236508,070,820457,568,00027,973,00017,154,048