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,570Success
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,564393,779,265360,500,00024,219,00016,797,696
2Oct 10, 2026 00:572,565393,918,712360,446,00024,405,00016,797,696
3Oct 10, 2026 00:572,569394,796,021360,988,00024,463,00016,797,696
4Oct 10, 2026 00:572,569394,354,826361,199,00024,171,00016,797,696
5Oct 10, 2026 00:572,570395,268,493361,092,00024,550,00016,797,696
6Oct 10, 2026 00:572,582397,711,880362,218,00025,165,00016,797,696
7Oct 10, 2026 00:572,583400,649,221363,027,00024,538,00016,797,696
8Oct 10, 2026 00:572,597398,662,520364,683,00024,884,00016,797,696
9Oct 10, 2026 00:572,607400,800,111365,942,00025,226,00016,797,696