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 30, 2026 00:26anboto1anboto1Score: 2,951Success
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:272,947452,095,675427,151,00014,976,00016,793,600
2Jul 30, 2026 00:272,947452,087,263427,087,00015,058,00016,793,600
3Jul 30, 2026 00:272,948452,310,182427,343,00014,982,00016,793,600
4Jul 30, 2026 00:272,950452,624,594427,548,00015,038,00016,793,600
5Jul 30, 2026 00:272,951452,980,342427,451,00015,208,00016,793,600
6Jul 30, 2026 00:272,952452,827,845427,700,00015,171,00016,793,600
7Jul 30, 2026 00:272,952452,957,929427,855,00015,085,00016,793,600
8Jul 30, 2026 00:272,953453,680,983427,825,00015,246,00016,793,600
9Jul 30, 2026 00:272,968455,178,415429,830,00015,403,00016,793,600