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 07:09Tomislav TunkovicTomislav TunkovicScore: 3,354Success
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 07:103,351512,732,347489,839,00012,817,00016,801,792stderr
2Aug 11, 2026 07:103,352513,767,316489,956,00012,946,00016,801,792stderr
3Aug 11, 2026 07:103,352513,782,007489,993,00012,952,00016,801,792stderr
4Aug 11, 2026 07:103,352512,865,878490,253,00012,667,00016,801,792stderr
5Aug 11, 2026 07:103,354513,878,104490,274,00012,883,00016,801,792stderr
6Aug 11, 2026 07:103,354513,097,958490,194,00012,953,00016,801,792stderr
7Aug 11, 2026 07:103,354513,261,514490,217,00012,977,00016,801,792stderr
8Aug 11, 2026 07:103,355515,126,802490,269,00013,111,00016,801,792stderr
9Aug 11, 2026 07:103,356513,450,902490,457,00012,988,00016,801,792stderr