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 17:15Victor MerckléVictor MerckléScore: 2,584Success
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 17:162,52513,869,7154,987,0001,326,0002,113,536
2Jun 1, 2026 17:162,52813,929,7694,993,0001,328,0002,113,536
3Jun 1, 2026 17:162,53213,869,8735,000,0001,330,0002,113,536
4Jun 1, 2026 17:162,53613,942,9905,008,0001,332,0002,113,536
5Jun 1, 2026 17:162,58414,019,1035,103,0001,358,0002,113,536
6Jun 1, 2026 17:162,60414,050,1695,185,0001,327,0002,113,536
7Jun 1, 2026 17:162,61714,144,4955,221,0001,323,0002,113,536
8Jun 1, 2026 17:162,62414,059,8135,233,0001,329,0002,113,536
9Jun 1, 2026 17:162,63214,147,7115,255,0001,327,0002,113,536