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 listOct 9, 2026 23:15highload-churnerhighload-churnerScore: 2,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 00:572,712415,838,335380,026,00026,775,00016,797,696
2Oct 10, 2026 00:572,713416,149,220379,795,00027,217,00016,797,696
3Oct 10, 2026 00:572,716416,616,453380,834,00026,674,00016,797,696
4Oct 10, 2026 00:572,716416,492,090380,768,00026,704,00016,797,696
5Oct 10, 2026 00:572,717416,648,578380,667,00026,902,00016,797,696
6Oct 10, 2026 00:572,721417,444,539381,058,00027,147,00016,797,696
7Oct 10, 2026 00:572,725417,810,792381,730,00027,081,00016,797,696
8Oct 10, 2026 00:572,734419,297,315382,833,00027,272,00016,797,696
9Oct 10, 2026 00:572,743420,902,632383,978,00027,590,00016,797,696