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 listNov 17, 2025 17:09Yuriy LyfenkoYuriy LyfenkoScore: 24,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2025 17:0924,87886,674,03659,187,0003,009,0002,285,568
2Nov 17, 2025 17:0924,90291,533,77360,246,0002,008,0002,285,568
3Nov 17, 2025 17:0925,03988,952,97859,569,0003,028,0002,285,568