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 listJan 5, 2026 04:31Josu San MartinJosu San MartinScore: 3,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 04:313,143499,874,542427,434,00043,941,00017,141,760
2Jan 5, 2026 04:303,144501,081,594432,619,00038,965,00016,965,632
3Jan 5, 2026 04:313,144506,950,794434,634,00036,968,00016,961,536
4Jan 5, 2026 04:303,145501,886,260429,761,00041,976,00017,068,032
5Jan 5, 2026 04:323,145499,320,143432,729,00038,975,00016,965,632
6Jan 5, 2026 04:313,150505,348,769430,489,00041,950,00017,043,456
7Jan 5, 2026 04:303,150504,027,855436,542,00035,962,00017,072,128
8Jan 5, 2026 04:303,151501,634,436432,686,00039,971,00017,076,224
9Jan 5, 2026 04:313,151499,192,808433,727,00038,975,00017,063,936
10Jan 5, 2026 04:303,152499,809,269436,811,00035,984,00017,076,224
11Jan 5, 2026 04:323,152500,606,669433,762,00038,978,00017,043,456
12Jan 5, 2026 04:303,153494,762,871438,884,00033,991,00016,961,536
13Jan 5, 2026 04:303,154504,325,790434,031,00039,002,00017,076,224
14Jan 5, 2026 04:313,156498,937,567435,502,00037,956,00017,170,432
15Jan 5, 2026 04:313,159503,370,685433,825,00039,983,00016,965,632
16Jan 5, 2026 04:323,160498,384,177432,034,00042,003,00017,072,128
17Jan 5, 2026 04:313,162499,539,000431,375,00042,937,00017,043,456
18Jan 5, 2026 04:313,162506,926,832431,412,00042,941,00017,145,856
19Jan 5, 2026 04:303,163498,815,510432,432,00041,944,00016,973,824
20Jan 5, 2026 04:303,174505,371,909431,039,00045,004,00017,108,992
21Jan 5, 2026 04:313,189502,354,925439,463,00038,952,00017,047,552