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 22:28anboto1anboto1Score: 3,385Success
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 22:293,354513,147,604478,970,00024,261,00016,793,600
2Jul 29, 2026 22:293,355513,309,128479,249,00024,052,00016,793,600
3Jul 29, 2026 22:293,371515,719,288480,957,00024,796,00016,793,600
4Jul 29, 2026 22:293,371515,648,747481,303,00024,417,00016,793,600
5Jul 29, 2026 22:293,385517,778,277482,965,00024,837,00016,793,600
6Jul 29, 2026 22:293,385517,835,495482,759,00025,089,00016,793,600
7Jul 29, 2026 22:293,394519,167,313483,583,00025,574,00016,793,600
8Jul 29, 2026 22:293,442526,206,066490,975,00025,370,00016,793,600
9Jul 29, 2026 22:293,475531,283,152495,652,00025,700,00016,793,600