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 listAug 25, 2026 12:28Navneet RajNavneet RajScore: 3,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 12:293,451527,473,515489,482,00028,174,00016,793,600
2Aug 25, 2026 12:293,454527,942,904489,597,00028,537,00016,793,600
3Aug 25, 2026 12:293,470530,501,205490,718,00029,829,00016,793,600
4Aug 25, 2026 12:293,471531,845,612491,803,00028,906,00016,793,600
5Aug 25, 2026 12:293,480531,793,601493,696,00028,328,00016,793,600
6Aug 25, 2026 12:293,482532,404,251493,736,00028,651,00016,793,600
7Aug 25, 2026 12:293,492533,677,251494,938,00028,926,00016,793,600
8Aug 25, 2026 12:293,495534,163,295495,175,00029,115,00016,793,600
9Aug 25, 2026 12:293,497534,436,557495,352,00029,230,00016,793,600