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 listMay 30, 2026 04:56Victor MerckléVictor MerckléScore: 2,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 04:572,52114,096,3454,971,0001,333,0002,113,536
2May 30, 2026 04:572,54414,107,2215,023,0001,339,0002,113,536
3May 30, 2026 04:572,59215,693,2995,120,0001,361,0002,113,536
4May 30, 2026 04:572,60416,103,6545,140,0001,372,0002,113,536
5May 30, 2026 04:572,60716,435,2605,194,0001,325,0002,113,536
6May 30, 2026 04:572,61814,341,6735,215,0001,330,0002,113,536
7May 30, 2026 04:572,63215,766,5395,253,0001,328,0002,113,536
8May 30, 2026 04:572,64814,346,4915,259,0001,363,0002,113,536
9May 30, 2026 04:572,65114,374,1365,280,0001,348,0002,113,536