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 1, 2026 15:07Victor MerckléVictor MerckléScore: 2,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 15:082,54315,405,3185,030,0001,328,0002,113,536
2Jun 1, 2026 15:082,55113,915,3315,051,0001,328,0002,113,536
3Jun 1, 2026 15:082,58714,015,3055,144,0001,325,0002,113,536
4Jun 1, 2026 15:082,59414,016,5615,165,0001,322,0002,113,536
5Jun 1, 2026 15:082,62814,128,4545,248,0001,324,0002,113,536
6Jun 1, 2026 15:082,64814,111,4155,294,0001,327,0002,113,536
7Jun 1, 2026 15:082,65214,155,6465,308,0001,322,0002,113,536
8Jun 1, 2026 15:082,65714,188,6735,312,0001,332,0002,113,536
9Jun 1, 2026 15:082,68314,231,9005,369,0001,340,0002,113,536