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 16, 2026 11:37Dominique GarmierDominique GarmierScore: 15,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 11:3715,71263,618,67336,258,0003,021,0002,441,216
2Mar 16, 2026 11:3715,82164,076,36033,468,0006,085,0002,428,928
3Mar 16, 2026 11:3715,84464,641,29437,579,0002,031,0002,260,992