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 22, 2025 09:05AnSaAnSaScore: 3,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2025 09:053,827598,015,107572,121,0002,000,00016,179,200
2Oct 22, 2025 09:053,828604,489,499572,221,0002,000,00016,392,192
3Oct 22, 2025 09:053,828607,513,172572,224,0002,000,00016,179,200
4Oct 22, 2025 09:053,828602,499,841572,246,0002,000,00016,396,288
5Oct 22, 2025 09:053,829603,188,848572,280,0002,000,00016,392,192
6Oct 22, 2025 09:053,829603,473,297572,329,0002,001,00016,392,192
7Oct 22, 2025 09:053,829603,493,034571,407,0002,996,00016,179,200
8Oct 22, 2025 09:053,830603,097,094571,500,0002,997,00016,400,384
9Oct 22, 2025 09:053,831600,926,749570,597,0003,997,00016,179,200