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 23, 2026 16:17Kasper KivimäkiKasper KivimäkiScore: 55,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 16:1954,4538,177,983,0988,126,868,00041,212,00016,793,600
2Jul 23, 2026 16:1954,8328,239,372,7048,187,548,00037,362,00016,793,600
3Jul 23, 2026 16:1954,9458,252,114,2288,198,709,00043,155,00016,793,600
4Jul 23, 2026 16:1954,9558,253,062,2058,198,099,00045,151,00016,793,600
5Jul 23, 2026 16:1955,2508,297,531,8558,244,285,00043,346,00016,793,600
6Jul 23, 2026 16:1955,2948,304,729,9658,250,037,00044,206,00016,793,600
7Jul 23, 2026 16:1957,0858,573,427,3638,524,668,00038,139,00016,793,600
8Jul 23, 2026 16:1957,1488,582,239,9498,534,457,00037,860,00016,793,600
9Jul 23, 2026 16:1957,3958,619,580,4178,571,642,00037,619,00016,793,600