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:36Victor 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:371,706265,252,948248,274,0007,773,00016,797,696
2Jun 12, 2026 05:371,707265,161,431248,344,0007,746,00016,797,696
3Jun 12, 2026 05:371,707265,207,462248,378,0007,759,00016,797,696
4Jun 12, 2026 05:371,707265,130,633248,305,0007,756,00016,797,696
5Jun 12, 2026 05:371,708265,431,092248,535,0007,718,00016,797,696
6Jun 12, 2026 05:371,708265,504,690248,493,0007,774,00016,797,696
7Jun 12, 2026 05:371,711265,802,433249,071,0007,681,00016,797,696
8Jun 12, 2026 05:371,711265,841,300249,013,0007,732,00016,797,696
9Jun 12, 2026 05:371,712265,860,549249,047,0007,770,00016,797,696