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 listJun 29, 2025 22:18Aniruddha DebAniruddha DebScore: 112,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2025 22:18111,799300,376,376276,492,0003,005,0002,519,040
2Jun 29, 2025 22:18112,784305,384,794276,961,0004,999,0002,347,008
3Jun 29, 2025 22:18112,869308,468,537277,169,0005,003,0002,437,120