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 10:56Dominique GarmierDominique GarmierScore: 15,594Success
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 10:5615,56966,919,02434,930,0003,992,0002,506,752
2Mar 16, 2026 10:5615,59464,184,61633,987,0004,998,0002,293,760
3Mar 16, 2026 10:5615,63861,529,70135,086,0004,009,0002,494,464