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 listJun 27, 2026 19:05Elijah KinElijah KinScore: 2,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 19:062,01224,246,1683,799,0001,233,0002,117,632
2Jun 27, 2026 19:062,01414,322,7623,804,0001,231,0002,117,632
3Jun 27, 2026 19:062,01514,427,0723,798,0001,241,0002,117,632
4Jun 27, 2026 19:062,01614,333,8363,813,0001,229,0002,117,632
5Jun 27, 2026 19:062,03014,344,3753,830,0001,245,0002,117,632
6Jun 27, 2026 19:062,19914,711,8334,239,0001,259,0002,117,632
7Jun 27, 2026 19:062,21114,847,2094,275,0001,253,0002,117,632
8Jun 27, 2026 19:062,28015,001,8854,456,0001,246,0002,117,632
9Jun 27, 2026 19:062,30414,938,7254,504,0001,256,0002,117,632