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 5, 2026 00:59Victor MerckléVictor MerckléScore: 1,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 01:001,828283,374,314267,277,0007,029,00016,797,696
2Jun 5, 2026 01:001,829283,520,659267,302,0007,075,00016,797,696
3Jun 5, 2026 01:001,829283,603,552267,416,0007,057,00016,797,696
4Jun 5, 2026 01:001,830283,808,432267,556,0006,994,00016,797,696
5Jun 5, 2026 01:001,830283,688,331267,567,0007,028,00016,797,696
6Jun 5, 2026 01:001,832284,065,480267,880,0007,016,00016,797,696
7Jun 5, 2026 01:001,832284,055,904267,924,0007,018,00016,797,696
8Jun 5, 2026 01:001,833284,174,351267,821,0007,171,00016,797,696
9Jun 5, 2026 01:001,834284,200,315268,037,0007,093,00016,797,696