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:22Dominique GarmierDominique GarmierScore: 3,233Success
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,212496,222,320457,824,00023,990,00017,219,584
2May 1, 2026 08:223,225505,432,275460,854,00022,992,00017,149,952
3May 1, 2026 08:223,226499,621,464460,997,00022,999,00017,133,568
4May 1, 2026 08:223,231504,234,063458,808,00025,989,00016,990,208
5May 1, 2026 08:223,233506,542,081456,994,00027,999,00017,129,472
6May 1, 2026 08:223,235509,181,503460,252,00025,013,00017,059,840
7May 1, 2026 08:223,235508,767,685461,251,00024,013,00017,145,856
8May 1, 2026 08:223,236508,028,156459,483,00025,970,00017,133,568
9May 1, 2026 08:223,240506,269,842460,071,00026,004,00017,141,760