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 10, 2026 03:31olliecrowolliecrowScore: 3,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 03:263,438541,145,970509,739,0005,996,00017,022,976
2Mar 10, 2026 03:263,440544,527,862509,049,0007,000,00017,186,816
3Mar 10, 2026 03:263,441546,723,366507,208,0009,003,00017,096,704
4Mar 10, 2026 03:263,442538,976,366510,230,0006,002,00017,096,704
5Mar 10, 2026 03:263,442540,148,957509,249,0007,003,00017,186,816
6Mar 10, 2026 03:303,442541,316,986509,226,0007,003,00017,190,912
7Mar 10, 2026 03:263,443544,759,260510,441,0005,993,00017,088,512
8Mar 10, 2026 03:263,443541,246,512509,497,0006,993,00016,969,728
9Mar 10, 2026 03:303,443547,071,024510,442,0005,993,00017,182,720
10Mar 10, 2026 03:273,444544,826,640511,543,0004,995,00016,945,152
11Mar 10, 2026 03:303,444543,292,857511,530,0004,995,00016,965,632
12Mar 10, 2026 03:263,446541,646,781509,844,0006,997,00017,022,976
13Mar 10, 2026 03:273,448547,870,021511,257,0006,003,00017,014,784
14Mar 10, 2026 03:263,460545,370,839510,020,0009,000,00017,072,128
15Mar 10, 2026 03:273,471544,603,083515,582,0004,995,00017,018,880
16Mar 10, 2026 03:313,509550,270,237516,328,00010,006,00017,047,552
17Mar 10, 2026 03:313,510551,426,595516,442,0009,989,00017,154,048
18Mar 10, 2026 03:313,511550,561,432515,655,00010,992,00017,043,456