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 23:57anboto1anboto1Score: 2,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:072,826434,132,951410,563,00013,377,00016,793,600
2Jul 30, 2026 00:072,826433,965,103410,575,00013,388,00016,793,600
3Jul 30, 2026 00:072,826434,056,470410,618,00013,393,00016,793,600
4Jul 30, 2026 00:072,826434,182,003410,481,00013,490,00016,793,600
5Jul 30, 2026 00:072,828434,185,958410,792,00013,409,00016,793,600
6Jul 30, 2026 00:072,829434,546,869410,893,00013,556,00016,793,600
7Jul 30, 2026 00:072,831434,633,126411,216,00013,549,00016,793,600
8Jul 30, 2026 00:072,832434,909,753411,345,00013,515,00016,793,600
9Jul 30, 2026 00:072,832434,987,497411,299,00013,527,00016,793,600