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:08Tomislav TunkovicTomislav TunkovicScore: 2,032Success
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:321,993309,478,926282,785,00016,217,00016,797,696
2Aug 17, 2026 02:322,001310,041,149283,798,00016,446,00016,797,696
3Aug 17, 2026 02:322,008311,127,257285,082,00016,150,00016,797,696
4Aug 17, 2026 02:322,019312,766,971286,569,00016,301,00016,797,696
5Aug 17, 2026 02:322,032314,877,923288,656,00016,247,00016,797,696
6Aug 17, 2026 02:322,034315,017,808288,779,00016,345,00016,797,696
7Aug 17, 2026 02:322,036316,025,263289,167,00016,266,00016,797,696
8Aug 17, 2026 02:322,049317,122,750291,042,00016,323,00016,797,696
9Aug 17, 2026 02:325,638855,636,594829,387,00016,367,00016,797,696