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 listJul 29, 2026 18:21anboto1anboto1Score: 2,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 18:222,514387,440,532362,076,00015,042,00016,793,600
2Jul 29, 2026 18:222,515387,679,182362,290,00015,073,00016,793,600
3Jul 29, 2026 18:222,515388,390,266362,322,00014,956,00016,793,600
4Jul 29, 2026 18:222,515387,464,198362,273,00015,053,00016,793,600
5Jul 29, 2026 18:222,519388,288,217362,852,00015,076,00016,793,600
6Jul 29, 2026 18:222,519388,961,019362,861,00015,046,00016,793,600
7Jul 29, 2026 18:222,520388,235,190362,935,00015,074,00016,793,600
8Jul 29, 2026 18:222,520388,532,513363,048,00015,076,00016,793,600
9Jul 29, 2026 18:222,521389,021,309363,200,00014,956,00016,793,600