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 26, 2026 20:08A_ShamanA_ShamanScore: 4,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 20:084,243645,661,265613,286,00023,261,00016,793,600
2Jun 26, 2026 20:084,250646,798,319615,039,00022,610,00016,793,600
3Jun 26, 2026 20:084,251647,032,228614,723,00023,021,00016,793,600
4Jun 26, 2026 20:084,252647,027,507614,629,00023,219,00016,793,600
5Jun 26, 2026 20:084,252647,021,148614,968,00022,910,00016,793,600
6Jun 26, 2026 20:084,255647,401,654615,318,00022,973,00016,793,600
7Jun 26, 2026 20:084,256647,704,564615,506,00022,987,00016,793,600
8Jun 26, 2026 20:084,258648,698,329615,947,00022,898,00016,793,600
9Jun 26, 2026 20:084,358668,168,885629,755,00024,091,00016,793,600