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:21Victor MerckléVictor MerckléScore: 1,715Success
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:221,714266,408,952249,345,0007,886,00016,797,696
2Jun 12, 2026 05:221,715266,865,166249,544,0007,824,00016,797,696
3Jun 12, 2026 05:221,715266,297,486249,612,0007,657,00016,797,696
4Jun 12, 2026 05:221,715266,340,331249,514,0007,754,00016,797,696
5Jun 12, 2026 05:221,715266,374,044249,593,0007,725,00016,797,696
6Jun 12, 2026 05:221,716266,534,708249,565,0007,900,00016,797,696
7Jun 12, 2026 05:221,720267,338,412250,346,0007,799,00016,797,696
8Jun 12, 2026 05:221,720267,670,682250,267,0007,823,00016,797,696
9Jun 12, 2026 05:221,720267,194,508250,302,0007,765,00016,797,696