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 2, 2026 02:26Victor MerckléVictor MerckléScore: 2,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 02:282,24113,291,6784,375,0001,229,0002,113,536
2Jun 2, 2026 02:282,34013,511,2224,615,0001,235,0002,113,536
3Jun 2, 2026 02:282,34414,830,5244,620,0001,240,0002,113,536
4Jun 2, 2026 02:282,34813,416,3044,629,0001,241,0002,113,536
5Jun 2, 2026 02:282,34913,516,7984,637,0001,236,0002,113,536
6Jun 2, 2026 02:282,36013,861,7434,656,0001,245,0002,113,536
7Jun 2, 2026 02:282,36513,816,4014,660,0001,254,0002,113,536
8Jun 2, 2026 02:282,37213,811,6224,670,0001,261,0002,113,536
9Jun 2, 2026 02:282,39913,985,1083,897,0002,102,0002,113,536