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 24, 2026 15:39Navneet RajNavneet RajScore: 3,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 15:403,837585,621,325573,522,0002,136,00016,793,600
2Aug 24, 2026 15:403,838585,801,752573,754,0002,060,00016,793,600
3Aug 24, 2026 15:403,840585,880,537573,899,0002,136,00016,793,600
4Aug 24, 2026 15:403,840586,992,657573,822,0002,184,00016,793,600
5Aug 24, 2026 15:403,841586,009,542574,109,0002,064,00016,793,600
6Aug 24, 2026 15:403,842586,231,562574,167,0002,187,00016,793,600
7Aug 24, 2026 15:403,843586,244,972574,387,0002,071,00016,793,600
8Aug 24, 2026 15:403,843586,441,080574,334,0002,183,00016,793,600
9Aug 24, 2026 15:403,844586,500,392574,452,0002,166,00016,793,600