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 13, 2026 20:20Victor MerckléVictor MerckléScore: 39,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 20:2138,795106,155,58490,895,0006,094,0002,117,632
2Jun 13, 2026 20:2139,089106,899,61590,489,0007,234,0002,117,632
3Jun 13, 2026 20:2139,210107,229,40890,885,0007,140,0002,117,632
4Jun 13, 2026 20:2139,268107,915,07691,023,0007,148,0002,117,632
5Jun 13, 2026 20:2139,689108,538,24492,080,0007,144,0002,117,632
6Jun 13, 2026 20:2140,164109,628,17793,304,0007,106,0002,117,632
7Jun 13, 2026 20:2140,213109,790,49993,317,0007,216,0002,117,632
8Jun 13, 2026 20:2140,252109,866,26593,243,0007,389,0002,117,632
9Jun 13, 2026 20:2140,528110,695,50094,024,0007,298,0002,117,632