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 1, 2026 00:35Josu San MartinJosu San MartinScore: 4,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 00:354,030637,997,123583,483,00020,981,00017,149,952
2Jan 1, 2026 00:354,033624,612,112584,899,00019,996,00016,969,728
3Jan 1, 2026 00:354,035634,420,643581,330,00023,972,00016,965,632
4Jan 1, 2026 00:354,041629,658,914582,143,00024,005,00017,182,720
5Jan 1, 2026 00:354,043640,428,766584,407,00021,977,00017,051,648
6Jan 1, 2026 00:354,069637,299,549588,341,00022,012,00017,190,912
7Jan 1, 2026 00:354,070641,948,841583,499,00026,976,00016,965,632
8Jan 1, 2026 00:354,076640,017,438583,418,00027,972,00017,051,648
9Jan 1, 2026 00:354,097643,811,928588,613,00025,982,00016,965,632