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 26, 2026 17:54Victor MerckléVictor MerckléScore: 1,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 17:551,857298,260,807270,707,0007,991,00017,240,064
2Apr 26, 2026 17:551,858299,356,612271,797,0006,994,00016,977,920
3Apr 26, 2026 17:551,858293,827,544270,728,0007,991,00017,059,840
4Apr 26, 2026 17:551,860295,972,886272,086,0007,002,00017,235,968
5Apr 26, 2026 17:551,860300,374,375272,112,0007,002,00017,240,064
6Apr 26, 2026 17:551,861293,846,698270,212,0009,007,00017,244,160
7Apr 26, 2026 17:551,865299,766,271271,784,0007,993,00017,059,840
8Apr 26, 2026 17:551,866297,531,265272,992,0006,999,00017,244,160
9Apr 26, 2026 17:551,866296,442,795273,973,0005,999,00017,244,160