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:11Tomislav TunkovicTomislav TunkovicScore: 1,672Success
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:121,668260,366,069240,890,0009,378,00016,027,648stderr
2Aug 15, 2026 16:121,670261,290,781241,034,0009,493,00016,027,648stderr
3Aug 15, 2026 16:121,671262,683,693241,122,0009,624,00016,027,648stderr
4Aug 15, 2026 16:121,671261,436,272241,117,0009,534,00016,027,648stderr
5Aug 15, 2026 16:121,672261,607,762241,429,0009,389,00016,027,648stderr
6Aug 15, 2026 16:121,673261,777,800241,539,0009,486,00016,027,648stderr
7Aug 15, 2026 16:121,674261,953,414241,846,0009,368,00016,027,648stderr
8Aug 15, 2026 16:121,675262,082,996241,825,0009,450,00016,027,648stderr
9Aug 15, 2026 16:121,675262,091,492241,889,0009,453,00016,027,648stderr