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 30, 2026 05:20Dominique GarmierDominique GarmierScore: 35,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 05:2034,908113,710,03482,255,0005,015,0002,289,664
2Mar 30, 2026 05:2035,242109,077,16184,102,0004,004,0002,367,488
3Mar 30, 2026 05:2035,556116,994,78585,895,0002,996,0002,371,584