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 24, 2026 11:45anboto1anboto1Score: 3,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:453,622552,565,853516,140,00027,187,00016,793,600
2Jun 24, 2026 11:453,628553,289,376517,022,00027,181,00016,793,600
3Jun 24, 2026 11:453,628553,419,902516,849,00027,446,00016,793,600
4Jun 24, 2026 11:453,629553,581,738516,855,00027,590,00016,793,600
5Jun 24, 2026 11:453,630553,678,109517,377,00027,166,00016,793,600
6Jun 24, 2026 11:453,632554,090,715517,688,00027,259,00016,793,600
7Jun 24, 2026 11:453,632555,859,546517,601,00027,272,00016,793,600
8Jun 24, 2026 11:453,635554,596,487517,250,00028,127,00016,793,600
9Jun 24, 2026 11:453,640555,256,364518,186,00027,892,00016,793,600