Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listAug 31, 2026 01:58Tomislav TunkovicTomislav TunkovicScore: 2,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 02:092,08214,774,1383,899,0001,306,000548,864
2Aug 31, 2026 02:092,08614,853,5533,901,0001,314,000548,864
3Aug 31, 2026 02:092,13914,981,1804,080,0001,269,000548,864
4Aug 31, 2026 02:092,16215,015,1834,119,0001,286,000548,864
5Aug 31, 2026 02:092,16615,038,3934,126,0001,289,000548,864
6Aug 31, 2026 02:092,18215,047,5944,195,0001,262,000548,864
7Aug 31, 2026 02:092,18215,020,5084,160,0001,295,000548,864
8Aug 31, 2026 02:092,18315,068,4184,187,0001,271,000548,864
9Aug 31, 2026 02:092,19215,104,4664,210,0001,272,000548,864