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:35Victor MerckléVictor MerckléScore: 1,857Success
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:351,854294,901,215268,134,00010,005,00017,199,104
2Apr 26, 2026 17:351,855295,920,450272,325,0006,007,00017,215,488
3Apr 26, 2026 17:351,855296,423,200269,250,0009,008,00017,211,392
4Apr 26, 2026 17:351,857298,958,835269,569,0008,985,00017,182,720
5Apr 26, 2026 17:351,857293,614,023269,633,0008,987,00017,199,104
6Apr 26, 2026 17:351,858298,424,219269,746,0008,991,00017,219,584
7Apr 26, 2026 17:351,861294,044,261272,201,0007,005,00017,215,488
8Apr 26, 2026 17:351,862301,151,405271,371,0007,981,00017,207,296
9Apr 26, 2026 17:351,863297,884,621272,481,0006,986,00017,223,680