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 listApr 28, 2026 13:31Dominique GarmierDominique GarmierScore: 3,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 13:313,271508,101,516465,758,00024,987,00017,154,048
2Apr 28, 2026 13:313,275511,823,410474,261,00017,009,00017,149,952
3Apr 28, 2026 13:313,275509,708,998465,364,00025,964,00017,145,856
4Apr 28, 2026 13:313,277511,750,736468,706,00022,985,00017,137,664
5Apr 28, 2026 13:313,282517,543,272470,430,00021,973,00016,998,400
6Apr 28, 2026 13:313,285510,936,840466,869,00025,992,00016,977,920
7Apr 28, 2026 13:313,286509,305,834462,950,00029,996,00017,145,856
8Apr 28, 2026 13:313,290515,373,403465,562,00027,973,00017,149,952
9Apr 28, 2026 13:313,291513,726,184468,742,00024,986,00017,141,760