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 listJul 2, 2026 11:18A_ShamanA_ShamanScore: 3,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 11:193,851587,354,955564,671,00012,989,00016,793,600
2Jul 2, 2026 11:193,853587,696,201564,930,00013,020,00016,797,696
3Jul 2, 2026 11:193,854588,206,116565,080,00013,089,00016,793,600
4Jul 2, 2026 11:193,855588,322,011565,114,00013,216,00016,793,600
5Jul 2, 2026 11:193,858588,355,102565,707,00013,006,00016,797,696
6Jul 2, 2026 11:193,858588,308,293565,245,00013,501,00016,797,696
7Jul 2, 2026 11:193,859589,035,617566,149,00012,815,00016,797,696
8Jul 2, 2026 11:193,859588,944,377566,043,00012,889,00016,793,600
9Jul 2, 2026 11:193,867590,320,685566,125,00013,980,00016,797,696