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 05:37olliecrowolliecrowScore: 3,412Success
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 05:373,411539,702,912506,607,0004,996,00017,047,552
2Mar 10, 2026 05:373,411533,719,363507,619,0003,997,00016,961,536
3Mar 10, 2026 05:373,411536,300,936507,724,0003,997,00017,006,592
4Mar 10, 2026 05:373,412538,359,694506,791,0004,997,00016,957,440
5Mar 10, 2026 05:373,412537,675,538508,832,0002,999,00017,186,816
6Mar 10, 2026 05:373,412540,629,955505,874,0005,998,00016,969,728
7Mar 10, 2026 05:373,413531,770,123507,993,0003,999,00017,182,720
8Mar 10, 2026 05:373,415539,101,305506,285,0005,991,00017,145,856
9Mar 10, 2026 05:373,417533,880,280507,484,0004,994,00017,199,104