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 4, 2026 22:14olliecrowolliecrowScore: 3,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 22:143,513551,211,823516,885,0009,997,00017,027,072
2Mar 4, 2026 22:143,513556,590,583514,969,00011,999,00017,051,648
3Mar 4, 2026 22:143,514551,926,350514,026,00013,000,00016,949,248
4Mar 4, 2026 22:143,514553,470,094518,102,0009,001,00016,953,344
5Mar 4, 2026 22:143,514552,936,330515,116,00012,002,00017,055,744
6Mar 4, 2026 22:143,515559,171,279513,266,00014,007,00016,998,400
7Mar 4, 2026 22:143,516550,656,084517,430,0009,989,00017,154,048
8Mar 4, 2026 22:143,516551,859,829515,466,00011,987,00017,051,648
9Mar 4, 2026 22:143,516555,753,400514,468,00012,986,00017,035,264