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 4, 2026 23:51olliecrowolliecrowScore: 3,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 23:513,507555,469,807515,060,00011,001,00017,063,936
2Mar 4, 2026 23:513,509553,683,685516,281,00010,005,00017,051,648
3Mar 4, 2026 23:513,509553,650,285514,437,00011,986,00017,051,648
4Mar 4, 2026 23:513,510560,099,776515,583,00010,991,00016,949,248
5Mar 4, 2026 23:513,512554,328,883513,759,00012,993,00017,014,784
6Mar 4, 2026 23:513,512552,085,727516,787,0009,995,00016,953,344
7Mar 4, 2026 23:513,512554,748,003515,831,00010,996,00016,953,344
8Mar 4, 2026 23:513,514553,515,173515,032,00012,000,00017,035,264
9Mar 4, 2026 23:513,514554,544,886518,164,0009,002,00017,039,360