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 listJan 30, 2025 19:25KeefeKeefeScore: 30,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2025 19:2530,318108,338,71867,817,0007,978,0002,342,912
2Jan 30, 2025 19:2530,464104,542,83768,143,0008,016,0002,314,240
3Jan 30, 2025 19:2530,716102,363,43468,813,0007,978,0002,281,472