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 12, 2026 02:36olliecrowolliecrowScore: 9,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 02:369,41246,194,79819,439,0004,092,0002,498,560
2Mar 12, 2026 02:369,44347,429,82720,529,0003,079,0002,326,528
3Mar 12, 2026 02:369,70650,610,19422,244,0002,022,0002,318,336