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 14, 2026 08:06Victor MerckléVictor MerckléScore: 1,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 08:191,75011,890,9733,138,0001,238,0002,117,632
2Jun 14, 2026 08:191,75011,913,7283,130,0001,246,0002,117,632
3Jun 14, 2026 08:191,76211,966,8333,113,0001,294,0002,117,632
4Jun 14, 2026 08:191,81012,068,7503,174,0001,352,0002,117,632
5Jun 14, 2026 08:191,87412,311,3353,404,0001,282,0002,117,632
6Jun 14, 2026 08:191,89012,266,1763,365,0001,360,0002,117,632
7Jun 14, 2026 08:191,89112,246,8853,466,0001,262,0002,117,632
8Jun 14, 2026 08:191,90112,308,3093,473,0001,280,0002,117,632
9Jun 14, 2026 08:191,91212,324,7393,493,0001,288,0002,117,632