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 20:09anboto1anboto1Score: 15,415Success
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 20:1013,5382,040,805,9082,004,441,00026,260,00016,793,600
2Jul 29, 2026 20:1015,1692,285,621,8302,248,834,00026,554,00016,793,600
3Jul 29, 2026 20:1015,1782,286,763,8302,251,033,00025,711,00016,793,600
4Jul 29, 2026 20:1015,2172,292,497,2632,256,903,00025,650,00016,793,600
5Jul 29, 2026 20:1015,4152,322,469,8942,285,906,00026,447,00016,793,600
6Jul 29, 2026 20:1015,4312,324,929,2532,288,938,00025,841,00016,793,600
7Jul 29, 2026 20:1020,2313,045,087,3043,008,949,00025,829,00016,793,600
8Jul 29, 2026 20:1020,5243,088,674,4793,053,118,00025,498,00016,793,600
9Jul 29, 2026 20:1020,6683,110,301,5173,074,709,00025,562,00016,793,600