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:13Tomislav TunkovicTomislav TunkovicScore: 1,730Success
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:131,726269,041,393249,758,0009,249,00016,027,648stderr
2Aug 15, 2026 15:131,726268,931,039250,541,0008,359,00016,027,648stderr
3Aug 15, 2026 15:131,727269,206,830249,772,0009,321,00016,027,648stderr
4Aug 15, 2026 15:131,730269,904,852251,341,0008,305,00016,027,648stderr
5Aug 15, 2026 15:131,730270,340,711251,093,0008,450,00016,027,648stderr
6Aug 15, 2026 15:131,731270,386,373251,349,0008,377,00016,027,648stderr
7Aug 15, 2026 15:131,731270,488,057251,332,0008,379,00016,027,648stderr
8Aug 15, 2026 15:131,732270,218,598251,536,0008,395,00016,027,648stderr
9Aug 15, 2026 15:131,732270,095,336251,482,0008,395,00016,027,648stderr