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 21, 2026 03:55e1011e1011Score: 17,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 03:5617,5062,636,902,8042,605,116,00020,875,00016,793,600
2Oct 21, 2026 03:5617,5142,638,133,3502,606,545,00020,704,00016,793,600
3Oct 21, 2026 03:5617,5592,644,861,8382,613,635,00020,248,00016,793,600
4Oct 21, 2026 03:5617,5962,650,478,3612,617,560,00021,902,00016,793,600
5Oct 21, 2026 03:5617,6392,656,958,6052,624,499,00021,373,00016,793,600
6Oct 21, 2026 03:5617,6502,658,534,3072,627,108,00020,498,00016,793,600
7Oct 21, 2026 03:5617,6552,659,222,8852,626,795,00021,554,00016,793,600
8Oct 21, 2026 03:5617,6622,660,238,9532,627,330,00022,075,00016,793,600
9Oct 21, 2026 03:5617,6942,664,962,8792,632,046,00022,056,00016,793,600