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 15, 2026 13:40Victor MerckléVictor MerckléScore: 1,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 13:491,72911,536,0243,103,0001,221,0002,117,632
2Jun 15, 2026 13:491,73911,699,3663,129,0001,220,0002,117,632
3Jun 15, 2026 13:491,78811,815,0693,256,0001,216,0002,117,632
4Jun 15, 2026 13:491,85211,912,8873,427,0001,205,0002,117,632
5Jun 15, 2026 13:491,86012,023,3613,441,0001,211,0002,117,632
6Jun 15, 2026 13:491,86612,013,0423,447,0001,218,0002,117,632
7Jun 15, 2026 13:491,89012,001,3713,474,0001,253,0002,117,632
8Jun 15, 2026 13:491,93012,030,0813,403,0001,423,0002,117,632
9Jun 15, 2026 13:491,93412,003,7573,399,0001,438,0002,117,632