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 4, 2026 19:16olliecrowolliecrowScore: 16,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 19:1616,25066,321,07236,563,0004,062,0002,400,256
2Mar 4, 2026 19:1616,26372,158,13137,608,0003,049,0002,396,160
3Mar 4, 2026 19:1616,35167,206,74735,892,0004,985,0002,383,872