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 15, 2026 10:52Dominique GarmierDominique GarmierScore: 34,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 10:5234,752122,556,72984,883,0001,997,0002,519,040
2Mar 15, 2026 10:5234,772109,862,12584,931,0001,998,0002,510,848
3Mar 15, 2026 10:5234,806116,288,11685,015,0002,000,0002,289,664