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 listOct 15, 2026 23:33izotoffizotoffScore: 8,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 23:418,9571,355,832,5991,330,844,00012,852,00016,822,272stderr
2Oct 15, 2026 23:418,9681,357,455,6591,332,533,00012,815,00016,822,272stderr
3Oct 15, 2026 23:418,9721,358,265,5851,333,406,00012,510,00016,822,272stderr
4Oct 15, 2026 23:418,9741,358,409,6451,333,406,00012,712,00016,822,272stderr
5Oct 15, 2026 23:418,9791,359,275,3691,334,301,00012,637,00016,822,272stderr
6Oct 15, 2026 23:418,9791,359,131,8381,334,171,00012,707,00016,822,272stderr
7Oct 15, 2026 23:418,9841,359,938,0581,334,901,00012,809,00016,826,368stderr
8Oct 15, 2026 23:418,9851,360,195,2551,335,160,00012,661,00016,822,272stderr
9Oct 15, 2026 23:419,0951,376,612,9761,351,236,00013,032,00016,822,272stderr