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 05:16Victor MerckléVictor MerckléScore: 1,715Success
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 05:171,712266,264,775249,189,0007,705,00016,797,696
2Jun 12, 2026 05:171,713266,226,457249,312,0007,759,00016,797,696
3Jun 12, 2026 05:171,713266,278,790249,318,0007,673,00016,797,696
4Jun 12, 2026 05:171,713266,264,088249,326,0007,743,00016,797,696
5Jun 12, 2026 05:171,715266,514,151249,531,0007,783,00016,797,696
6Jun 12, 2026 05:171,715266,326,696249,526,0007,731,00016,797,696
7Jun 12, 2026 05:171,718266,842,364250,071,0007,719,00016,797,696
8Jun 12, 2026 05:171,719266,992,724250,068,0007,787,00016,797,696
9Jun 12, 2026 05:171,721267,669,203250,387,0007,839,00016,797,696