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 listJun 12, 2026 07:12Victor MerckléVictor MerckléScore: 1,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 07:131,693263,138,739246,345,0007,687,00016,797,696
2Jun 12, 2026 07:131,693263,305,511246,363,0007,676,00016,797,696
3Jun 12, 2026 07:131,693263,226,804246,337,0007,723,00016,797,696
4Jun 12, 2026 07:131,694263,224,278246,416,0007,704,00016,797,696
5Jun 12, 2026 07:131,694263,655,816246,441,0007,748,00016,797,696
6Jun 12, 2026 07:131,694263,265,094246,379,0007,727,00016,797,696
7Jun 12, 2026 07:131,699264,078,216247,176,0007,767,00016,797,696
8Jun 12, 2026 07:131,700264,245,024247,235,0007,867,00016,797,696
9Jun 12, 2026 07:131,700264,041,353247,278,0007,748,00016,797,696