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 7, 2026 19:15Karthik ReddyKarthik ReddyScore: 1,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 19:161,704264,608,851249,898,0005,705,00016,793,600
2Oct 7, 2026 19:161,704264,684,002249,976,0005,716,00016,793,600
3Oct 7, 2026 19:161,705264,778,386250,139,0005,692,00016,793,600
4Oct 7, 2026 19:161,706265,095,447250,316,0005,710,00016,793,600
5Oct 7, 2026 19:161,706265,086,254250,182,0005,797,00016,793,600
6Oct 7, 2026 19:161,707265,163,804250,399,0005,757,00016,793,600
7Oct 7, 2026 19:161,708266,654,715250,522,0005,794,00016,793,600
8Oct 7, 2026 19:161,708265,202,713250,453,0005,753,00016,793,600
9Oct 7, 2026 19:161,710265,605,553250,823,0005,761,00016,793,600