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 21:50anboto1anboto1Score: 3,445Success
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 21:513,424523,702,114492,288,00021,399,00016,793,600
2Jul 29, 2026 21:513,425523,769,972492,497,00021,321,00016,793,600
3Jul 29, 2026 21:513,427524,139,893492,784,00021,377,00016,793,600
4Jul 29, 2026 21:513,444526,646,051494,097,00022,580,00016,793,600
5Jul 29, 2026 21:513,445534,291,612494,346,00022,414,00016,793,600
6Jul 29, 2026 21:513,455528,494,718496,476,00021,818,00016,793,600
7Jul 29, 2026 21:513,462529,527,494497,030,00022,406,00016,793,600
8Jul 29, 2026 21:513,463529,543,311497,789,00021,716,00016,793,600
9Jul 29, 2026 21:513,501536,649,607502,810,00022,343,00016,793,600