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 listJun 24, 2026 13:05anboto1anboto1Score: 3,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 13:053,112476,184,366441,140,00025,784,00016,793,600
2Jun 24, 2026 13:053,112476,048,090441,057,00025,816,00016,793,600
3Jun 24, 2026 13:053,115476,543,175441,597,00025,717,00016,793,600
4Jun 24, 2026 13:053,121477,421,734443,202,00025,062,00016,793,600
5Jun 24, 2026 13:053,124477,838,814442,861,00025,762,00016,793,600
6Jun 24, 2026 13:053,125478,658,050442,749,00026,002,00016,793,600
7Jun 24, 2026 13:053,126477,997,626442,543,00026,362,00016,793,600
8Jun 24, 2026 13:053,131478,732,540443,496,00026,162,00016,793,600
9Jun 24, 2026 13:053,133479,138,300442,937,00027,048,00016,793,600