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:24Tomislav TunkovicTomislav TunkovicScore: 1,722Success
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:251,720268,013,374249,610,0008,428,00016,027,648stderr
2Aug 15, 2026 15:251,721268,137,397249,831,0008,352,00016,027,648stderr
3Aug 15, 2026 15:251,721268,264,434249,894,0008,364,00016,027,648stderr
4Aug 15, 2026 15:251,722268,299,871248,987,0009,327,00016,027,648stderr
5Aug 15, 2026 15:251,722268,345,480249,027,0009,308,00016,027,648stderr
6Aug 15, 2026 15:251,725269,066,590250,251,0008,528,00016,027,648stderr
7Aug 15, 2026 15:251,725269,576,931250,438,0008,447,00016,027,648stderr
8Aug 15, 2026 15:251,726269,804,351250,529,0008,468,00016,027,648stderr
9Aug 15, 2026 15:251,726269,772,499250,598,0008,389,00016,027,648stderr