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:22Kasper KivimäkiKasper KivimäkiScore: 5,617Success
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:225,610851,339,280814,620,00026,963,00016,793,600
2Jul 23, 2026 16:225,611852,212,145814,665,00026,997,00016,793,600
3Jul 23, 2026 16:225,616852,190,833815,308,00027,134,00016,793,600
4Jul 23, 2026 16:225,616852,318,026815,074,00027,447,00016,793,600
5Jul 23, 2026 16:225,617852,377,074814,477,00028,124,00016,793,600
6Jul 23, 2026 16:225,618852,659,104815,866,00026,920,00016,793,600
7Jul 23, 2026 16:225,619852,762,367815,440,00027,494,00016,793,600
8Jul 23, 2026 16:225,624853,515,568815,610,00028,010,00016,793,600
9Jul 23, 2026 16:225,634855,092,006817,808,00027,410,00016,793,600