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 14:16Tomislav TunkovicTomislav TunkovicScore: 8,164Success
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 14:257,75327,711,56916,159,0003,225,0002,117,632
2Aug 14, 2026 14:257,79927,869,62716,264,0003,234,0002,117,632
3Aug 14, 2026 14:257,95328,194,72316,609,0003,275,0002,117,632
4Aug 14, 2026 14:258,11228,673,46417,017,0003,264,0002,117,632
5Aug 14, 2026 14:258,16429,512,07517,153,0003,259,0002,117,632
6Aug 14, 2026 14:258,16929,529,36817,187,0003,236,0002,117,632
7Aug 14, 2026 14:258,19428,844,62817,164,0003,321,0002,117,632
8Aug 14, 2026 14:258,24628,933,26317,305,0003,310,0002,117,632
9Aug 14, 2026 14:258,47229,676,69517,925,0003,256,0002,117,632