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 listMar 21, 2026 21:41Yuriy LyfenkoYuriy LyfenkoScore: 3,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 21:413,952619,127,572568,816,00023,992,00016,945,152
2Mar 21, 2026 21:413,952621,704,370571,807,00020,992,00017,178,624
3Mar 21, 2026 21:413,952615,762,504566,864,00025,993,00016,953,344
4Mar 21, 2026 21:413,953618,113,909565,948,00026,997,00016,953,344
5Mar 21, 2026 21:413,953620,941,701567,959,00024,998,00017,010,688
6Mar 21, 2026 21:413,959621,242,764571,845,00021,994,00017,035,264