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 10:10Aleksei ShahoikaAleksei ShahoikaScore: 2,108Success
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 10:112,098325,724,639308,746,0006,022,00016,797,696
2May 14, 2026 10:112,101326,986,675309,389,0005,771,00016,797,696
3May 14, 2026 10:112,105324,841,805309,669,0006,120,00016,797,696
4May 14, 2026 10:112,105324,570,598310,065,0005,713,00016,797,696
5May 14, 2026 10:112,108327,358,453310,476,0005,803,00016,797,696
6May 14, 2026 10:112,108325,113,478310,536,0005,709,00016,797,696
7May 14, 2026 10:112,109327,083,849310,442,0006,012,00016,797,696
8May 14, 2026 10:112,121329,146,354312,506,0005,733,00016,797,696
9May 14, 2026 10:112,130328,333,263313,520,0006,063,00016,797,696