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 listFeb 19, 2025 20:47Ian MckibbenIan MckibbenScore: 342,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2025 20:47342,228878,393,671854,570,000999,0002,281,472
2Feb 19, 2025 20:47342,451883,144,685856,127,00002,281,472
3Feb 19, 2025 20:47342,885880,332,708856,214,000999,0002,461,696