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:56anboto1anboto1Score: 2,720Success
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:572,716417,508,328392,920,00014,594,00016,793,600
2Jul 29, 2026 18:572,716417,519,662393,045,00014,503,00016,793,600
3Jul 29, 2026 18:572,717417,481,675393,054,00014,510,00016,793,600
4Jul 29, 2026 18:572,719417,960,291393,310,00014,585,00016,793,600
5Jul 29, 2026 18:572,720418,195,952393,603,00014,488,00016,793,600
6Jul 29, 2026 18:572,721418,263,067393,744,00014,526,00016,793,600
7Jul 29, 2026 18:572,723418,526,039394,006,00014,527,00016,793,600
8Jul 29, 2026 18:572,725418,777,031394,068,00014,697,00016,793,600
9Jul 29, 2026 18:572,728419,209,008394,466,00014,739,00016,793,600