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 14, 2026 16:13Tomislav TunkovicTomislav TunkovicScore: 4,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 16:144,48619,551,78710,016,0001,201,0002,121,728
2Aug 14, 2026 16:144,49419,477,85410,024,0001,211,0002,121,728
3Aug 14, 2026 16:144,49619,904,53410,019,0001,222,0002,121,728
4Aug 14, 2026 16:144,50619,609,90210,063,0001,204,0002,121,728
5Aug 14, 2026 16:144,51219,588,21210,052,0001,228,0002,121,728
6Aug 14, 2026 16:144,52119,700,65210,083,0001,221,0002,121,728
7Aug 14, 2026 16:144,75020,208,44810,645,0001,232,0002,121,728
8Aug 14, 2026 16:144,75720,259,41010,662,0001,232,0002,121,728
9Aug 14, 2026 16:144,91721,329,59011,080,0001,214,0002,121,728