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 21:42olliecrowolliecrowScore: 3,588Success
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 21:423,580563,307,932524,003,00013,000,00017,084,416
2Mar 4, 2026 21:423,584561,545,331525,604,00011,990,00016,941,056
3Mar 4, 2026 21:423,586565,285,647525,915,00011,998,00016,986,112
4Mar 4, 2026 21:423,587567,668,398525,036,00013,000,00017,186,816
5Mar 4, 2026 21:423,588563,992,794526,170,00012,003,00016,977,920
6Mar 4, 2026 21:423,590568,491,102528,525,0009,991,00017,186,816
7Mar 4, 2026 21:423,592569,110,148527,767,00010,995,00017,096,704
8Mar 4, 2026 21:423,596572,240,662528,344,00011,007,00016,949,248
9Mar 4, 2026 21:423,596571,119,728526,419,00012,985,00016,973,824