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:21Dominique GarmierDominique GarmierScore: 21,246Success
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:2121,16086,103,52846,913,0005,988,0002,367,488
2Mar 30, 2026 05:2121,24676,826,59550,108,0003,006,0002,367,488
3Mar 30, 2026 05:2121,29581,325,86249,220,0004,017,0002,527,232