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 listMar 5, 2026 00:02olliecrowolliecrowScore: 3,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 03:163,505556,255,980512,829,00012,995,00017,149,952
2Mar 10, 2026 03:163,505551,741,336513,769,00011,994,00017,055,744
3Mar 10, 2026 03:163,506553,402,637516,887,0008,998,00017,002,496
4Mar 10, 2026 03:163,506563,220,065518,850,0006,997,00016,953,344
5Mar 4, 2026 23:573,507554,292,913513,105,00013,002,00017,068,032
6Mar 10, 2026 03:163,508553,103,265516,195,00010,003,00017,047,552
7Mar 10, 2026 03:163,508561,324,038517,152,0009,002,00017,051,648
8Mar 5, 2026 00:023,509554,568,544513,332,00013,008,00017,059,840
9Mar 5, 2026 00:023,509553,664,675513,415,00012,985,00016,969,728
10Mar 4, 2026 23:573,510553,201,151516,465,00010,009,00017,059,840
11Mar 10, 2026 03:163,510554,611,367514,501,00011,988,00017,031,168
12Mar 10, 2026 03:163,510550,223,360514,526,00011,988,00017,055,744
13Mar 5, 2026 00:023,510552,960,157515,482,00010,988,00017,055,744
14Mar 5, 2026 00:023,511557,042,428513,711,00012,992,00017,068,032
15Mar 5, 2026 00:023,511550,509,146517,695,0008,994,00017,055,744
16Mar 5, 2026 00:023,511554,405,212515,670,00010,992,00016,998,400
17Mar 5, 2026 00:023,512552,542,039517,803,0008,996,00017,059,840
18Mar 4, 2026 23:573,512550,517,129514,795,00011,995,00017,178,624
19Mar 5, 2026 00:023,513553,195,715517,957,0008,999,00017,051,648
20Mar 5, 2026 00:023,516554,350,602518,359,0008,988,00016,945,152
21Mar 10, 2026 03:163,529552,115,112516,308,00012,982,00017,059,840