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 10:50Victor MerckléVictor MerckléScore: 2,606Success
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 10:522,51213,852,8564,951,0001,330,0002,113,536
2Jun 1, 2026 10:522,53513,888,2265,002,0001,337,0002,113,536
3Jun 1, 2026 10:522,57513,930,9965,109,0001,330,0002,113,536
4Jun 1, 2026 10:522,57813,994,7175,103,0001,344,0002,113,536
5Jun 1, 2026 10:522,60614,037,9475,195,0001,321,0002,113,536
6Jun 1, 2026 10:522,61214,316,6505,205,0001,326,0002,113,536
7Jun 1, 2026 10:522,61214,011,0565,212,0001,319,0002,113,536
8Jun 1, 2026 10:522,61614,015,9475,214,0001,326,0002,113,536
9Jun 1, 2026 10:522,62814,202,8265,244,0001,326,0002,113,536