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:20Dominique GarmierDominique GarmierScore: 3,275Success
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:213,269510,765,396464,504,00025,972,00017,108,992
2May 1, 2026 08:213,272511,011,087462,913,00027,994,00017,145,856
3May 1, 2026 08:213,273509,120,503466,040,00025,002,00017,149,952
4May 1, 2026 08:213,274507,691,242468,104,00023,005,00017,141,760
5May 1, 2026 08:213,275511,517,886464,386,00026,964,00017,145,856
6May 1, 2026 08:213,281505,961,943463,145,00029,009,00016,998,400
7May 1, 2026 08:213,283507,846,630470,581,00021,980,00017,149,952
8May 1, 2026 08:213,286507,310,970467,971,00025,051,00017,149,952
9May 1, 2026 08:213,286511,797,013467,000,00026,000,00017,145,856