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:00anboto1anboto1Score: 24,109Success
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:0123,8323,585,390,1333,550,587,00024,346,00016,793,600
2Jul 29, 2026 20:0123,9273,599,122,8423,565,104,00023,971,00016,793,600
3Jul 29, 2026 20:0123,9733,606,107,3423,572,228,00023,722,00016,793,600
4Jul 29, 2026 20:0124,0233,613,707,6823,579,416,00024,148,00016,793,600
5Jul 29, 2026 20:0124,1093,626,740,9213,591,507,00024,961,00016,793,600
6Jul 29, 2026 20:0124,1203,628,033,5563,593,695,00024,311,00016,793,600
7Jul 29, 2026 20:0124,1523,633,098,8603,597,581,00025,244,00016,793,600
8Jul 29, 2026 20:0124,2393,646,091,8193,610,925,00025,061,00016,793,600
9Jul 29, 2026 20:0124,2943,654,252,4573,618,864,00025,378,00016,793,600