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:23highload-churnerhighload-churnerScore: 2,985Success
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 15:562,973454,960,233420,303,00025,725,00016,797,696
2Oct 9, 2026 15:562,979456,470,007421,068,00025,823,00016,797,696
3Oct 9, 2026 15:562,981456,296,947421,593,00025,567,00016,797,696
4Oct 9, 2026 15:562,984456,644,490422,128,00025,496,00016,797,696
5Oct 9, 2026 15:562,985456,814,694422,204,00025,587,00016,797,696
6Oct 9, 2026 15:562,991457,729,604423,136,00025,539,00016,797,696
7Oct 9, 2026 15:562,993458,040,384423,365,00025,585,00016,797,696
8Oct 9, 2026 15:562,993458,045,166423,338,00025,659,00016,797,696
9Oct 9, 2026 15:563,001459,465,427424,401,00025,792,00016,797,696