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 24, 2026 16:24Navneet RajNavneet RajScore: 3,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 16:253,952603,319,230586,899,0006,033,00016,805,888
2Aug 24, 2026 16:253,955603,731,368588,242,0005,122,00016,805,888
3Aug 24, 2026 16:253,960604,407,052588,998,0005,151,00016,805,888
4Aug 24, 2026 16:253,961604,584,632589,100,0005,132,00016,805,888
5Aug 24, 2026 16:253,965605,130,815589,605,0005,155,00016,805,888
6Aug 24, 2026 16:253,965605,202,261589,763,0005,040,00016,805,888
7Aug 24, 2026 16:253,966606,128,104589,834,0005,210,00016,805,888
8Aug 24, 2026 16:253,968605,509,965591,084,0004,140,00016,805,888
9Aug 24, 2026 16:253,975607,060,452591,063,0005,216,00016,805,888