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 4, 2026 18:16Josu San MartinJosu San MartinScore: 3,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 18:143,502549,220,337482,335,00042,940,00017,059,840
2Jan 4, 2026 18:143,502550,599,087487,379,00037,951,00016,957,440
3Jan 4, 2026 18:143,508553,696,773487,226,00038,938,00017,195,008
4Jan 4, 2026 18:143,508552,558,484486,198,00040,016,00017,096,704
5Jan 4, 2026 18:163,509551,233,334483,428,00042,949,00016,977,920
6Jan 4, 2026 18:143,515563,246,269488,318,00038,945,00017,035,264
7Jan 4, 2026 18:143,516557,296,134486,391,00040,948,00017,080,320
8Jan 4, 2026 18:163,519555,304,048489,808,00037,985,00016,990,208
9Jan 4, 2026 18:143,520558,972,730486,980,00040,998,00017,195,008
10Jan 4, 2026 18:163,525550,585,942485,746,00042,977,00017,203,200
11Jan 4, 2026 18:143,527555,930,394483,981,00044,998,00017,027,072
12Jan 4, 2026 18:143,529563,376,777490,359,00039,028,00017,190,912