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 listOct 21, 2025 10:57AnSaAnSaScore: 4,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2025 10:574,090636,988,471595,551,00017,986,00016,965,632
2Oct 21, 2025 10:574,090638,337,574590,535,00023,020,00017,051,648
3Oct 21, 2025 10:574,092639,815,394597,855,00015,996,00016,953,344
4Oct 21, 2025 10:574,098642,267,071593,730,00020,990,00017,047,552
5Oct 21, 2025 10:574,098639,537,448594,772,00019,992,00017,047,552
6Oct 21, 2025 10:574,100637,719,039591,035,00024,001,00017,039,360
7Oct 21, 2025 10:574,106637,865,597603,971,00011,999,00017,047,552
8Oct 21, 2025 10:574,113638,592,514595,009,00022,000,00017,137,664
9Oct 21, 2025 10:574,202660,132,024606,369,00023,975,00017,068,032