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:11Tomislav TunkovicTomislav TunkovicScore: 9,155Success
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:149,10331,737,16319,548,0003,210,0002,117,632
2Aug 14, 2026 14:149,13231,887,39019,633,0003,198,0002,117,632
3Aug 14, 2026 14:149,14031,208,63319,632,0003,218,0002,117,632
4Aug 14, 2026 14:149,14332,033,24319,628,0003,230,0002,117,632
5Aug 14, 2026 14:149,15533,302,83419,658,0003,230,0002,117,632
6Aug 14, 2026 14:149,16531,065,60519,713,0003,201,0002,117,632
7Aug 14, 2026 14:149,46032,138,66520,357,0003,295,0002,117,632
8Aug 14, 2026 14:149,47631,917,92920,457,0003,234,0002,117,632
9Aug 14, 2026 14:149,49332,200,46520,438,0003,295,0002,117,632