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 21, 2026 03:44e1011e1011Score: 23,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 03:4523,0043,461,588,5003,432,795,00017,878,00016,793,600
2Oct 21, 2026 03:4523,0123,462,647,1013,434,102,00017,761,00016,793,600
3Oct 21, 2026 03:4523,0163,463,746,3983,434,498,00017,995,00016,793,600
4Oct 21, 2026 03:4523,0353,466,350,3383,437,570,00017,726,00016,793,600
5Oct 21, 2026 03:4523,0383,466,740,1743,437,931,00017,805,00016,793,600
6Oct 21, 2026 03:4523,0433,467,470,1983,438,689,00017,773,00016,793,600
7Oct 21, 2026 03:4523,0433,468,997,6643,438,791,00017,779,00016,793,600
8Oct 21, 2026 03:4523,0743,472,106,2523,443,525,00017,714,00016,793,600
9Oct 21, 2026 03:4523,6563,559,566,6503,530,016,00018,529,00016,793,600