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 11, 2026 10:11Tomislav TunkovicTomislav TunkovicScore: 1,870Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 10:121,869291,529,372271,390,0009,065,00016,801,792stderr
2Aug 11, 2026 10:121,869290,403,158271,355,0009,024,00016,801,792stderr
3Aug 11, 2026 10:121,869290,697,296271,402,0009,019,00016,801,792stderr
4Aug 11, 2026 10:121,869290,349,624271,341,0009,014,00016,801,792stderr
5Aug 11, 2026 10:121,870291,430,573271,503,0009,132,00016,801,792stderr
6Aug 11, 2026 10:121,870291,288,552271,395,0009,118,00016,801,792stderr
7Aug 11, 2026 10:121,871292,102,297271,607,0009,173,00016,801,792stderr
8Aug 11, 2026 10:121,871291,475,167271,636,0009,162,00016,801,792stderr
9Aug 11, 2026 10:121,871290,710,294271,549,0009,142,00016,801,792stderr