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 7, 2026 11:51Victor MerckléVictor MerckléScore: 1,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 11:531,73512,017,1513,119,0001,219,0002,113,536
2Jun 7, 2026 11:531,74812,005,7713,148,0001,222,0002,113,536
3Jun 7, 2026 11:531,75112,043,4383,153,0001,225,0002,113,536
4Jun 7, 2026 11:531,76213,369,4533,188,0001,219,0002,113,536
5Jun 7, 2026 11:531,84512,304,3503,407,0001,207,0002,113,536
6Jun 7, 2026 11:531,86112,346,2723,418,0001,235,0002,113,536
7Jun 7, 2026 11:531,87612,358,2633,534,0001,156,0002,113,536
8Jun 7, 2026 11:531,87812,709,2633,460,0001,235,0002,113,536
9Jun 7, 2026 11:531,88114,933,0453,470,0001,233,0002,113,536