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 01:15e1011e1011Score: 19,399Success
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 01:1719,3442,913,024,1132,879,101,00022,507,00016,793,600
2Oct 21, 2026 01:1719,3522,916,135,3442,880,143,00022,787,00016,793,600
3Oct 21, 2026 01:1719,3852,918,901,3732,885,557,00022,314,00016,793,600
4Oct 21, 2026 01:1719,3872,919,168,0322,886,794,00021,391,00016,793,600
5Oct 21, 2026 01:1719,3992,921,272,9622,888,061,00021,913,00016,793,600
6Oct 21, 2026 01:1719,4002,920,894,8022,888,318,00021,707,00016,793,600
7Oct 21, 2026 01:1719,4872,934,515,5502,901,844,00021,355,00016,793,600
8Oct 21, 2026 01:1719,4892,934,250,6142,901,677,00021,730,00016,793,600
9Oct 21, 2026 01:1719,5232,939,355,9322,906,378,00022,175,00016,793,600