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 listApr 30, 2026 03:46Charles CabergsCharles CabergsScore: 3,816Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 03:473,812592,637,726564,867,0006,998,00017,133,568
2Apr 30, 2026 03:473,814591,797,487565,178,0006,989,00017,145,856
3Apr 30, 2026 03:473,815589,127,954567,362,0004,994,00017,129,472
4Apr 30, 2026 03:473,816588,828,325565,410,0007,005,00017,133,568
5Apr 30, 2026 03:473,816589,626,287565,463,0006,993,00017,133,568
6Apr 30, 2026 03:473,817592,941,975566,651,0005,996,00017,137,664
7Apr 30, 2026 03:473,819591,583,229566,865,0005,998,00017,133,568
8Apr 30, 2026 03:473,820589,384,164566,053,0007,000,00017,006,592
9Apr 30, 2026 03:473,821590,260,100567,228,0005,991,00017,223,680