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 12, 2026 05:51Victor MerckléVictor MerckléScore: 1,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 05:521,706265,019,080248,311,0007,612,00016,797,696
2Jun 12, 2026 05:521,706265,025,720248,309,0007,692,00016,797,696
3Jun 12, 2026 05:521,707265,214,356248,313,0007,755,00016,797,696
4Jun 12, 2026 05:521,707265,199,292248,319,0007,756,00016,797,696
5Jun 12, 2026 05:521,708265,387,354248,457,0007,760,00016,797,696
6Jun 12, 2026 05:521,708265,631,192248,469,0007,747,00016,797,696
7Jun 12, 2026 05:521,712265,907,597249,116,0007,741,00016,797,696
8Jun 12, 2026 05:521,713266,147,359249,277,0007,784,00016,797,696
9Jun 12, 2026 05:521,713266,442,149249,150,0007,849,00016,797,696