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 listAug 15, 2026 06:27Tomislav TunkovicTomislav TunkovicScore: 1,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 06:271,746272,011,980250,125,00011,776,00016,801,792stderr
2Aug 15, 2026 06:271,747272,134,508250,313,00011,840,00016,801,792stderr
3Aug 15, 2026 06:271,747272,218,246250,228,00011,930,00016,801,792stderr
4Aug 15, 2026 06:271,747272,065,647250,173,00011,898,00016,801,792stderr
5Aug 15, 2026 06:271,749272,799,145250,421,00012,051,00016,801,792stderr
6Aug 15, 2026 06:271,749272,392,686250,433,00011,944,00016,801,792stderr
7Aug 15, 2026 06:271,749272,471,483250,487,00011,972,00016,801,792stderr
8Aug 15, 2026 06:271,751272,711,456251,099,00011,587,00016,801,792stderr
9Aug 15, 2026 06:271,753273,023,486251,336,00011,635,00016,801,792stderr