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 22, 2026 17:28Charles CabergsCharles CabergsScore: 4,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 17:294,019618,478,603594,988,0007,999,00017,203,200
2Apr 22, 2026 17:294,021623,110,138593,191,0009,986,00016,990,208
3Apr 22, 2026 17:294,023622,102,966594,580,0008,993,00017,211,392
4Apr 22, 2026 17:294,025619,360,474594,791,0008,996,00016,998,400
5Apr 22, 2026 17:294,026618,487,396595,032,0009,000,00017,002,496
6Apr 22, 2026 17:294,029622,419,298594,367,0009,989,00017,203,200
7Apr 22, 2026 17:294,030619,581,656595,623,0008,994,00017,211,392
8Apr 22, 2026 17:294,030622,779,797595,520,0008,992,00017,219,584
9Apr 22, 2026 17:294,035625,319,546596,332,0009,005,00017,211,392