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 06:46Victor MerckléVictor MerckléScore: 1,698Success
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 06:471,697263,713,136247,013,0007,668,00016,797,696
2Jun 12, 2026 06:471,698263,920,957247,158,0007,655,00016,797,696
3Jun 12, 2026 06:471,698264,076,351247,104,0007,693,00016,797,696
4Jun 12, 2026 06:471,698264,086,518246,998,0007,848,00016,797,696
5Jun 12, 2026 06:471,698263,836,705247,034,0007,723,00016,797,696
6Jun 12, 2026 06:471,699264,043,071247,263,0007,716,00016,797,696
7Jun 12, 2026 06:471,702264,456,952247,563,0007,776,00016,797,696
8Jun 12, 2026 06:471,703264,716,523247,836,0007,760,00016,797,696
9Jun 12, 2026 06:471,703264,478,270247,674,0007,778,00016,797,696