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 2, 2026 11:08A_ShamanA_ShamanScore: 3,857Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 11:093,852587,548,516564,787,00013,068,00016,793,600
2Jul 2, 2026 11:093,854590,124,229565,073,00013,148,00016,797,696
3Jul 2, 2026 11:093,856588,524,665565,621,00012,915,00016,797,696
4Jul 2, 2026 11:093,856589,049,638565,579,00012,876,00016,797,696
5Jul 2, 2026 11:093,857588,257,393566,092,00012,538,00016,793,600
6Jul 2, 2026 11:093,857588,113,954565,643,00012,923,00016,797,696
7Jul 2, 2026 11:093,859589,131,098566,021,00012,977,00016,797,696
8Jul 2, 2026 11:093,860588,603,696565,596,00013,414,00016,797,696
9Jul 2, 2026 11:093,861589,134,475565,696,00013,496,00016,797,696