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 09:56Aleksei ShahoikaAleksei ShahoikaScore: 2,130Success
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 09:562,118326,605,549312,157,0005,627,00016,797,696
2May 14, 2026 09:562,120326,742,056312,333,0005,713,00016,797,696
3May 14, 2026 09:562,121327,024,129312,455,0005,799,00016,797,696
4May 14, 2026 09:562,124329,260,101312,860,0005,754,00016,797,696
5May 14, 2026 09:562,130328,301,234313,840,0005,708,00016,797,696
6May 14, 2026 09:562,131331,596,471314,060,0005,677,00016,797,696
7May 14, 2026 09:562,134330,731,390314,473,0005,696,00016,797,696
8May 14, 2026 09:562,140330,824,859315,322,0005,802,00016,797,696
9May 14, 2026 09:562,156334,322,629317,744,0005,713,00016,797,696