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 listJan 5, 2026 03:11Josu San MartinJosu San MartinScore: 3,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 02:293,339531,448,741462,901,00037,991,00017,215,488
2Jan 5, 2026 02:213,342531,273,917463,345,00037,946,00017,154,048
3Jan 5, 2026 04:003,342526,867,523467,398,00033,956,00017,117,184
4Jan 5, 2026 03:113,345531,569,449463,757,00037,980,00017,080,320
5Jan 5, 2026 02:213,348528,952,046466,127,00036,009,00017,051,648
6Jan 5, 2026 02:293,348527,264,156466,123,00036,009,00017,162,240
7Jan 5, 2026 04:003,348532,945,770462,118,00040,010,00017,158,144
8Jan 5, 2026 04:003,349531,374,868464,358,00037,947,00017,063,936
9Jan 5, 2026 03:113,353532,664,427471,009,00032,000,00017,158,144
10Jan 5, 2026 03:113,354527,620,183465,157,00038,012,00017,162,240
11Jan 5, 2026 02:213,355533,583,455462,232,00041,020,00017,154,048
12Jan 5, 2026 02:293,355538,395,093464,364,00038,946,00017,154,048