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 21, 2026 17:54A_ShamanA_ShamanScore: 4,933Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:544,926748,371,903712,470,00026,486,00016,805,888
2Jun 21, 2026 17:544,927748,471,108712,110,00027,007,00016,793,600
3Jun 21, 2026 17:544,927748,475,579712,910,00026,237,00016,805,888
4Jun 21, 2026 17:544,930748,932,752713,713,00025,855,00016,805,888
5Jun 21, 2026 17:544,933749,241,728713,903,00026,048,00016,805,888
6Jun 21, 2026 17:544,937749,997,009714,008,00026,648,00016,805,888
7Jun 21, 2026 17:544,938750,825,117714,105,00026,665,00016,805,888
8Jun 21, 2026 17:544,939750,135,708715,121,00025,735,00016,805,888
9Jun 21, 2026 17:544,943750,931,463715,030,00026,497,00016,805,888