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 17, 2026 15:46Victor MerckléVictor MerckléScore: 1,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:471,664258,905,003242,071,0007,656,00016,797,696
2Jun 17, 2026 15:471,665258,964,735242,139,0007,701,00016,797,696
3Jun 17, 2026 15:471,666259,469,953242,261,0007,728,00016,797,696
4Jun 17, 2026 15:471,666259,062,810242,284,0007,716,00016,797,696
5Jun 17, 2026 15:471,667259,403,381242,351,0007,758,00016,797,696
6Jun 17, 2026 15:471,669259,559,860242,555,0007,903,00016,797,696
7Jun 17, 2026 15:471,671259,879,003242,922,0007,788,00016,797,696
8Jun 17, 2026 15:471,671260,272,432242,967,0007,799,00016,797,696
9Jun 17, 2026 15:471,673260,611,603243,204,0007,859,00016,797,696