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 listOct 6, 2026 12:18janwwwjanwwwScore: 1,332,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 12:191,329,30510,384,908,3613,320,228,0003,036,0002,113,536
2Oct 6, 2026 12:191,330,94210,388,731,8053,326,355,0001,001,0002,113,536
3Oct 6, 2026 12:191,331,04310,388,989,2703,326,608,0001,000,0002,113,536
4Oct 6, 2026 12:191,332,12410,391,780,2173,329,310,0001,000,0002,113,536
5Oct 6, 2026 12:191,332,20910,391,334,2483,329,513,0001,011,0002,113,536
6Oct 6, 2026 12:191,332,40610,391,836,4063,330,014,0001,001,0002,113,536
7Oct 6, 2026 12:191,332,53910,392,797,7163,330,348,0001,000,0002,113,536
8Oct 6, 2026 12:191,334,62410,397,405,5923,335,560,0001,000,0002,113,536
9Oct 6, 2026 12:191,338,13710,406,641,2513,344,343,0001,000,0002,113,536