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 15:24highload-churnerhighload-churnerScore: 2,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 16:012,860438,296,270403,528,00025,529,00016,797,696
2Oct 9, 2026 16:012,863438,536,921403,961,00025,528,00016,797,696
3Oct 9, 2026 16:012,869439,337,969404,778,00025,601,00016,797,696
4Oct 9, 2026 16:012,870439,663,394405,135,00025,460,00016,797,696
5Oct 9, 2026 16:012,870439,995,664404,713,00025,818,00016,797,696
6Oct 9, 2026 16:012,873440,115,411405,591,00025,503,00016,797,696
7Oct 9, 2026 16:012,875440,490,831404,966,00026,351,00016,797,696
8Oct 9, 2026 16:012,876440,466,514405,950,00025,591,00016,797,696
9Oct 9, 2026 16:012,886441,970,168406,832,00026,145,00016,797,696