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 15, 2026 14:22Victor MerckléVictor MerckléScore: 1,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 14:231,672258,526,882243,121,0007,770,00016,797,696
2Jun 15, 2026 14:231,673258,640,242243,277,0007,714,00016,797,696
3Jun 15, 2026 14:231,673258,854,687243,382,0007,685,00016,797,696
4Jun 15, 2026 14:231,673258,585,574243,247,0007,745,00016,797,696
5Jun 15, 2026 14:231,673258,640,249243,296,0007,659,00016,797,696
6Jun 15, 2026 14:231,675259,101,557243,629,0007,755,00016,797,696
7Jun 15, 2026 14:231,678259,362,606243,923,0007,794,00016,797,696
8Jun 15, 2026 14:231,678259,480,363244,083,0007,752,00016,797,696
9Jun 15, 2026 14:231,680259,704,069244,173,0007,859,00016,797,696