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 17, 2026 17:16Victor MerckléVictor MerckléScore: 1,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 17:171,662258,818,811241,592,0007,854,00016,797,696
2Jun 17, 2026 17:171,664258,793,608241,743,0007,881,00016,797,696
3Jun 17, 2026 17:171,664258,798,799241,631,0008,082,00016,797,696
4Jun 17, 2026 17:171,665258,931,751241,884,0007,897,00016,797,696
5Jun 17, 2026 17:171,666259,101,129241,967,0007,974,00016,797,696
6Jun 17, 2026 17:171,666259,239,169242,190,0007,829,00016,797,696
7Jun 17, 2026 17:171,668259,387,345242,371,0007,890,00016,797,696
8Jun 17, 2026 17:171,669259,886,112242,481,0007,943,00016,797,696
9Jun 17, 2026 17:171,671259,842,379242,756,0007,983,00016,797,696