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 listDec 30, 2025 22:04Aniruddha DebAniruddha DebScore: 3,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 22:043,84228,148,5377,470,0002,134,0002,416,640
2Dec 30, 2025 22:043,84322,837,6596,405,0003,202,0002,281,472
3Dec 30, 2025 22:043,84829,581,7706,414,0003,207,0002,281,472
4Dec 30, 2025 22:043,85330,750,3597,492,0002,140,0002,281,472
5Dec 30, 2025 22:043,85425,192,8526,423,0003,211,0002,281,472
6Dec 30, 2025 22:043,86123,644,1337,507,0002,145,0002,277,376
7Dec 30, 2025 22:043,86229,040,4157,509,0002,145,0002,281,472
8Dec 30, 2025 22:043,98427,229,2386,972,0002,988,0002,277,376
9Dec 30, 2025 22:043,99827,870,8166,997,0002,998,0002,273,280