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 16:21Tomislav TunkovicTomislav TunkovicScore: 1,727Success
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 16:221,722268,738,960248,839,0009,577,00016,027,648stderr
2Aug 15, 2026 16:221,722268,556,440248,994,0009,441,00016,027,648stderr
3Aug 15, 2026 16:221,723268,454,190249,238,0009,249,00016,027,648stderr
4Aug 15, 2026 16:221,724268,710,476249,368,0009,360,00016,027,648stderr
5Aug 15, 2026 16:221,727269,114,486249,626,0009,458,00016,027,648stderr
6Aug 15, 2026 16:221,729269,694,602249,906,0009,462,00016,027,648stderr
7Aug 15, 2026 16:221,729270,273,452250,111,0009,311,00016,027,648stderr
8Aug 15, 2026 16:221,742272,374,768252,117,0009,305,00016,027,648stderr
9Aug 15, 2026 16:221,746273,194,906252,620,0009,394,00016,027,648stderr