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 19, 2025 19:41Aleksei ShahoikaAleksei ShahoikaScore: 12,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2025 19:4111,9001,810,659,7711,748,138,00036,918,00017,002,496
2Oct 19, 2025 19:4112,2901,870,140,6821,807,634,00035,913,00017,104,896
3Oct 19, 2025 19:4112,3001,872,866,1641,803,090,00041,909,00017,051,648
4Oct 19, 2025 19:4112,3151,874,603,5301,809,359,00037,902,00017,088,512
5Oct 19, 2025 19:4112,3511,876,356,3261,823,696,00028,931,00017,059,840
6Oct 19, 2025 19:4112,4841,900,232,9911,840,640,00031,924,00016,969,728
7Oct 19, 2025 19:4112,6191,919,559,9221,857,972,00034,905,00017,051,648
8Oct 19, 2025 19:4113,4872,050,736,0581,988,115,00034,914,00016,953,344
9Oct 19, 2025 19:4113,4942,054,331,0271,987,158,00036,910,00017,043,456