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 15, 2026 04:56olliecrowolliecrowScore: 35,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 04:5635,575110,857,27786,940,0001,998,0002,371,584
2Apr 15, 2026 04:5635,747114,061,74588,364,0001,004,0002,371,584
3Apr 15, 2026 04:5636,286118,197,62488,701,0002,015,0002,383,872