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 listSep 26, 2026 11:40Kevin HeaveyKevin HeaveyScore: 1,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 11:401,60713,374,3722,824,0001,194,0002,113,536
2Sep 26, 2026 11:401,60813,434,9382,833,0001,189,0002,113,536
3Sep 26, 2026 11:401,61312,751,1482,833,0001,201,0002,113,536