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:38anboto1anboto1Score: 3,497Success
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:393,447527,140,811495,122,00022,033,00016,793,600
2Jul 29, 2026 21:393,453527,934,167496,184,00021,828,00016,793,600
3Jul 29, 2026 21:393,463529,461,787497,346,00022,108,00016,793,600
4Jul 29, 2026 21:393,467530,101,070497,412,00022,778,00016,793,600
5Jul 29, 2026 21:393,497534,686,184502,396,00022,263,00016,793,600
6Jul 29, 2026 21:393,498534,779,914502,650,00022,078,00016,793,600
7Jul 29, 2026 21:393,525538,857,259507,501,00021,293,00016,793,600
8Jul 29, 2026 21:393,531539,605,397508,511,00021,156,00016,793,600
9Jul 29, 2026 21:393,550542,699,706510,587,00021,999,00016,793,600