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 14, 2026 03:19Victor MerckléVictor MerckléScore: 5,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 03:205,48322,954,99210,544,0003,164,0002,117,632
2Jun 14, 2026 03:205,52024,052,82710,630,0003,171,0002,117,632
3Jun 14, 2026 03:205,56523,092,25810,711,0003,203,0002,117,632
4Jun 14, 2026 03:205,83923,766,86011,423,0003,176,0002,117,632
5Jun 14, 2026 03:205,96124,080,93811,748,0003,156,0002,117,632
6Jun 14, 2026 03:205,98723,971,34611,833,0003,136,0002,117,632
7Jun 14, 2026 03:206,00224,165,96311,857,0003,148,0002,117,632
8Jun 14, 2026 03:206,02224,404,81411,919,0003,138,0002,117,632
9Jun 14, 2026 03:206,09024,539,85512,059,0003,168,0002,117,632