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 26, 2026 10:58Dominique GarmierDominique GarmierScore: 49,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 10:5849,532156,796,252117,838,0005,991,0002,367,488
2Mar 26, 2026 10:5849,578153,407,688117,947,0005,997,0002,412,544
3Mar 26, 2026 10:5849,678148,250,631119,189,0005,007,0002,527,232