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 19, 2026 12:09Dominique GarmierDominique GarmierScore: 9,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 12:099,60049,928,73619,000,0005,000,0002,527,232
2Mar 19, 2026 12:099,64548,563,21018,084,0006,028,0002,510,848
3Mar 19, 2026 12:099,82854,917,39220,476,0004,095,0002,527,232