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 15:34Tomislav TunkovicTomislav TunkovicScore: 1,739Success
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 15:361,737271,993,776252,285,0008,358,00016,027,648stderr
2Aug 15, 2026 15:361,737270,672,682252,292,0008,365,00016,027,648stderr
3Aug 15, 2026 15:361,739270,965,800251,599,0009,310,00016,027,648stderr
4Aug 15, 2026 15:361,739270,834,229251,549,0009,325,00016,027,648stderr
5Aug 15, 2026 15:361,739271,463,544252,594,0008,383,00016,027,648stderr
6Aug 15, 2026 15:361,740270,968,173252,486,0008,515,00016,027,648stderr
7Aug 15, 2026 15:361,740271,103,782251,736,0009,341,00016,027,648stderr
8Aug 15, 2026 15:361,748282,802,416252,795,0009,462,00016,027,648stderr
9Aug 15, 2026 15:361,753277,845,164254,665,0008,341,00016,027,648stderr