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 16, 2026 23:09Tomislav TunkovicTomislav TunkovicScore: 1,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 02:501,936300,859,913274,613,00015,874,00016,793,600
2Aug 17, 2026 02:501,937298,581,859274,509,00016,065,00016,793,600
3Aug 17, 2026 02:501,939298,874,805274,928,00016,010,00016,793,600
4Aug 17, 2026 02:501,945301,129,537275,684,00016,201,00016,793,600
5Aug 17, 2026 02:501,958301,912,658277,573,00016,182,00016,793,600
6Aug 17, 2026 02:501,965304,343,841278,594,00016,259,00016,793,600
7Aug 17, 2026 02:501,965303,061,120278,751,00016,085,00016,793,600
8Aug 17, 2026 02:501,966303,271,049278,863,00016,144,00016,793,600
9Aug 17, 2026 02:501,967303,376,111278,364,00016,771,00016,793,600