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 17, 2026 10:48Aleksei ShahoikaAleksei ShahoikaScore: 1,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 10:491,980307,421,754291,360,0005,744,00016,797,696
2May 17, 2026 10:491,982306,228,603291,822,0005,525,00016,797,696
3May 17, 2026 10:491,983307,977,863291,838,0005,673,00016,797,696
4May 17, 2026 10:491,984306,394,337292,184,0005,432,00016,797,696
5May 17, 2026 10:491,987309,156,946292,757,0005,363,00016,797,696
6May 17, 2026 10:491,987307,111,845292,778,0005,406,00016,797,696
7May 17, 2026 10:491,987307,191,080292,645,0005,506,00016,797,696
8May 17, 2026 10:491,988308,839,100292,667,0005,542,00016,797,696
9May 17, 2026 10:491,990308,413,885293,163,0005,462,00016,797,696