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 29, 2026 08:00Dominique GarmierDominique GarmierScore: 9,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 08:008,94246,085,94518,292,0004,064,0002,310,144
2Mar 29, 2026 08:009,01443,812,21518,438,0004,097,0002,269,184
3Mar 29, 2026 08:009,32455,541,20017,229,0006,081,0002,269,184