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 listSep 26, 2026 14:38Kevin HeaveyKevin HeaveyScore: 1,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 14:391,569244,238,504229,397,0006,037,00016,793,600
2Sep 26, 2026 14:391,570244,419,542229,493,0006,073,00016,793,600
3Sep 26, 2026 14:391,570244,480,853229,574,0006,059,00016,793,600
4Sep 26, 2026 14:391,570244,562,174229,524,0006,093,00016,793,600
5Sep 26, 2026 14:391,572244,691,512229,779,0006,120,00016,793,600
6Sep 26, 2026 14:391,574245,030,943230,076,0006,153,00016,793,600
7Sep 26, 2026 14:391,575245,175,428230,183,0006,197,00016,793,600
8Sep 26, 2026 14:391,577249,712,393230,412,0006,144,00016,793,600
9Sep 26, 2026 14:391,582246,176,937231,205,0006,120,00016,793,600