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 listJun 20, 2026 17:34A_ShamanA_ShamanScore: 6,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 17:346,7981,029,246,229977,324,00042,513,00016,797,696
2Jun 20, 2026 17:346,8121,031,232,888980,233,00041,642,00016,797,696
3Jun 20, 2026 17:346,8251,033,245,187983,596,00040,211,00016,797,696
4Jun 20, 2026 17:346,8751,040,632,494988,756,00042,529,00016,797,696
5Jun 20, 2026 17:346,8931,043,360,719991,609,00042,385,00016,797,696
6Jun 20, 2026 17:346,9231,047,819,760996,385,00042,148,00016,797,696
7Jun 20, 2026 17:347,1371,079,974,2551,029,255,00041,305,00016,797,696
8Jun 20, 2026 17:347,1421,080,694,0961,029,941,00041,426,00016,797,696
9Jun 20, 2026 17:347,1531,082,413,3681,031,722,00041,373,00016,797,696