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 00:18Tomislav TunkovicTomislav TunkovicScore: 1,837Success
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 00:181,834285,195,207264,640,00010,553,00016,801,792stderr
2Aug 15, 2026 00:181,834286,164,099264,579,00010,649,00016,801,792stderr
3Aug 15, 2026 00:181,835286,180,312264,675,00010,680,00016,801,792stderr
4Aug 15, 2026 00:181,836285,500,785264,937,00010,598,00016,801,792stderr
5Aug 15, 2026 00:181,837286,327,157265,043,00010,587,00016,801,792stderr
6Aug 15, 2026 00:181,838286,584,731265,145,00010,684,00016,801,792stderr
7Aug 15, 2026 00:181,839286,624,984265,192,00010,737,00016,801,792stderr
8Aug 15, 2026 00:181,840286,742,402265,341,00010,674,00016,801,792stderr
9Aug 15, 2026 00:181,841286,334,487265,483,00010,687,00016,801,792stderr