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 listMar 24, 2026 10:40Dominique GarmierDominique GarmierScore: 45,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 10:4045,916143,053,859105,808,0008,983,0002,351,104
2Mar 24, 2026 10:4045,932141,367,077107,842,0006,989,0002,310,144
3Mar 24, 2026 10:4046,872146,382,816109,167,0008,012,0002,351,104