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 listMay 14, 2026 00:27Aleksei ShahoikaAleksei ShahoikaScore: 2,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 00:282,447377,168,796361,147,0005,962,00016,797,696
2May 14, 2026 00:282,447377,590,296361,183,0005,989,00016,797,696
3May 14, 2026 00:282,451376,524,942362,054,0005,657,00016,797,696
4May 14, 2026 00:282,452378,675,807362,069,0005,791,00016,797,696
5May 14, 2026 00:282,453376,976,763362,089,0005,985,00016,797,696
6May 14, 2026 00:282,463378,353,011363,554,0005,922,00016,797,696
7May 14, 2026 00:282,468379,187,080364,229,0006,072,00016,797,696
8May 14, 2026 00:282,491385,483,210367,999,0005,746,00016,797,696
9May 14, 2026 00:282,500383,956,317369,274,0005,771,00016,797,696