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:21Tomislav TunkovicTomislav TunkovicScore: 1,699Success
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:221,696264,534,688245,265,0009,223,00016,027,648stderr
2Aug 15, 2026 15:221,696264,528,889245,906,0008,627,00016,027,648stderr
3Aug 15, 2026 15:221,698264,707,070246,328,0008,384,00016,027,648stderr
4Aug 15, 2026 15:221,699265,043,037245,661,0009,312,00016,027,648stderr
5Aug 15, 2026 15:221,699265,026,097245,638,0009,322,00016,027,648stderr
6Aug 15, 2026 15:221,702265,465,862246,929,0008,466,00016,027,648stderr
7Aug 15, 2026 15:221,702265,888,582246,803,0008,527,00016,027,648stderr
8Aug 15, 2026 15:221,703266,349,040247,174,0008,365,00016,027,648stderr
9Aug 15, 2026 15:221,703266,307,360247,253,0008,323,00016,027,648stderr