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 19, 2026 03:07Charles CabergsCharles CabergsScore: 4,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 03:074,319667,375,009639,855,0007,998,00016,953,344
2Apr 19, 2026 03:074,320669,994,509640,038,0008,000,00016,953,344
3Apr 19, 2026 03:074,321675,184,495641,188,0007,002,00017,199,104
4Apr 19, 2026 03:074,322678,015,437642,364,0005,994,00016,953,344
5Apr 19, 2026 03:074,323672,818,815640,453,0007,993,00016,953,344
6Apr 19, 2026 03:074,323671,764,023640,462,0007,993,00016,953,344
7Apr 19, 2026 03:074,324673,945,816640,614,0007,995,00016,953,344
8Apr 19, 2026 03:074,396691,254,069651,413,0007,992,00016,977,920
9Apr 19, 2026 03:074,463696,847,604660,432,0008,992,00016,969,728