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 listMar 14, 2026 11:14KeefeKeefeScore: 3,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 11:143,78425,933,1797,357,0002,102,0002,277,376
2Mar 14, 2026 11:143,79924,756,7846,332,0003,166,0002,285,568
3Mar 14, 2026 11:144,56127,109,5718,293,0003,110,0002,293,760