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 listJul 24, 2026 06:46Kasper KivimäkiKasper KivimäkiScore: 5,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 06:475,305805,520,370767,767,00028,004,00016,793,600
2Jul 24, 2026 06:475,306805,740,748768,422,00027,509,00016,793,600
3Jul 24, 2026 06:475,308806,051,280768,410,00027,825,00016,793,600
4Jul 24, 2026 06:475,312806,626,783768,951,00027,970,00016,793,600
5Jul 24, 2026 06:475,316807,400,860769,619,00027,891,00016,793,600
6Jul 24, 2026 06:475,324808,426,626770,287,00028,317,00016,793,600
7Jul 24, 2026 06:475,324808,992,421771,888,00026,778,00016,793,600
8Jul 24, 2026 06:475,331810,128,714772,026,00027,770,00016,793,600
9Jul 24, 2026 06:475,348812,184,752774,325,00027,949,00016,793,600