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 21, 2026 18:13A_ShamanA_ShamanScore: 4,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 18:144,191638,462,877598,773,00030,011,00016,797,696
2Jun 21, 2026 18:144,193638,360,117598,687,00030,409,00016,793,600
3Jun 21, 2026 18:144,198639,123,286598,611,00031,123,00016,797,696
4Jun 21, 2026 18:144,199639,194,025598,384,00031,518,00016,797,696
5Jun 21, 2026 18:144,258648,352,079607,829,00030,890,00016,793,600
6Jun 21, 2026 18:144,299654,421,632614,102,00030,763,00016,797,696
7Jun 21, 2026 18:144,333659,397,311618,444,00031,640,00016,793,600
8Jun 21, 2026 18:144,352662,667,467620,625,00032,288,00016,797,696
9Jun 21, 2026 18:144,407670,405,643630,220,00030,834,00016,797,696