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 listFeb 16, 2026 18:22Valentin KofmanValentin KofmanScore: 3,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:223,861605,189,218570,111,0009,001,00017,063,936
2Feb 16, 2026 18:223,862606,250,167568,339,00011,006,00017,170,432
3Feb 16, 2026 18:223,862608,405,039568,342,00011,006,00016,945,152
4Feb 16, 2026 18:223,863604,336,421569,452,00010,007,00017,092,608
5Feb 16, 2026 18:223,867604,768,737569,006,00011,000,00017,113,088
6Feb 16, 2026 18:223,868603,387,811569,160,00011,003,00017,080,320
7Feb 16, 2026 18:223,868603,256,710570,182,00010,003,00017,174,528
8Feb 16, 2026 18:223,870602,473,189569,549,00010,991,00017,129,472
9Feb 16, 2026 18:227,9941,229,300,5441,191,148,0008,000,00017,178,624