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 8, 2026 20:59Victor MerckléVictor MerckléScore: 1,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 21:001,717265,616,174249,840,0007,752,00016,797,696
2Jun 8, 2026 21:001,717265,828,914249,889,0007,791,00016,797,696
3Jun 8, 2026 21:001,717265,450,590249,928,0007,729,00016,797,696
4Jun 8, 2026 21:001,718265,311,201250,000,0007,710,00016,797,696
5Jun 8, 2026 21:001,718265,999,466250,019,0007,816,00016,797,696
6Jun 8, 2026 21:001,719266,046,008250,190,0007,773,00016,797,696
7Jun 8, 2026 21:001,722266,192,626250,645,0007,793,00016,797,696
8Jun 8, 2026 21:001,724266,732,909250,799,0007,826,00016,797,696
9Jun 8, 2026 21:001,725266,722,009251,027,0007,832,00016,797,696