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 10, 2026 05:03olliecrowolliecrowScore: 11,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 05:0311,30160,839,49724,216,0004,036,0002,334,720
2Mar 10, 2026 05:0311,37251,666,30325,383,0003,046,0002,338,816
3Mar 10, 2026 05:0311,43352,294,22024,499,0004,083,0002,301,952