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:33Aniruddha DebAniruddha DebScore: 7,305Success
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:337,20044,964,28814,000,0004,000,0002,260,992
2Jun 29, 2025 22:337,20240,728,28112,003,0006,001,0002,519,040
3Jun 29, 2025 22:337,22641,111,14213,047,0005,018,0002,367,488
4Jun 29, 2025 22:337,30535,109,89414,204,0004,058,0002,359,296
5Jun 29, 2025 22:337,32240,661,38514,238,0004,068,0002,289,664
6Jun 29, 2025 22:337,95845,475,85812,932,0006,963,0002,510,848