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:14anboto1anboto1Score: 2,864Success
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:152,860439,035,022420,435,0008,655,00016,793,600
2Jul 29, 2026 18:152,862439,415,703420,848,0008,594,00016,793,600
3Jul 29, 2026 18:152,862439,347,390420,777,0008,632,00016,793,600
4Jul 29, 2026 18:152,863439,561,526420,932,0008,665,00016,793,600
5Jul 29, 2026 18:152,864439,686,373420,926,0008,709,00016,793,600
6Jul 29, 2026 18:152,865440,139,540421,193,0008,679,00016,793,600
7Jul 29, 2026 18:152,866439,878,623421,299,0008,603,00016,793,600
8Jul 29, 2026 18:152,866439,841,030421,250,0008,674,00016,793,600
9Jul 29, 2026 18:152,918458,276,424428,939,0008,851,00016,793,600