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 18:16olliecrowolliecrowScore: 24,657Success
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 18:1624,62089,674,55457,514,0004,036,0002,281,472
2Mar 4, 2026 18:1624,65793,709,20157,601,0004,042,0002,318,336
3Mar 4, 2026 18:1625,00386,906,89758,475,0004,032,0002,281,472