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 listApr 19, 2025 01:57KeefeKeefeScore: 26,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 01:5725,95389,896,89260,891,0003,992,0002,359,296
2Apr 19, 2025 01:5726,49693,655,97859,215,0007,025,0002,285,568
3Apr 19, 2025 01:5726,77690,522,52863,944,0002,997,0002,359,296