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 29, 2026 16:53Dominique GarmierDominique GarmierScore: 361,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 16:53360,35854,106,421,39454,039,731,00013,993,00016,965,632
2Mar 29, 2026 16:53361,56554,287,906,48754,222,782,00011,994,00016,973,824
3Mar 29, 2026 16:53361,72254,322,408,38554,245,283,00012,993,00016,965,632