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:51Ian MckibbenIan MckibbenScore: 341,825Success
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:51341,822877,435,889852,558,0001,998,0002,445,312
2Feb 19, 2025 20:51341,825872,535,804853,563,000999,0002,281,472
3Feb 19, 2025 20:51342,084882,086,872852,213,0002,997,0002,281,472