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 15, 2026 16:37Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 02:25Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 03:59012,612,4303,079,0001,241,0002,113,536pos 32: expected 0 got 255
2Jun 15, 2026 16:401,70711,699,9523,067,0001,202,0002,113,536
3Jun 15, 2026 16:401,71311,684,1523,079,0001,205,0002,113,536
4Jun 15, 2026 16:401,72911,660,7853,110,0001,214,0002,113,536
5Jun 15, 2026 16:401,77211,842,2473,214,0001,216,0002,113,536
6Jun 15, 2026 16:401,77611,837,5373,091,0001,351,0002,113,536
7Jun 15, 2026 16:401,80111,876,9133,290,0001,213,0002,113,536
8Sep 5, 2026 03:591,82212,918,8693,366,0001,191,0002,113,536
9Jun 15, 2026 16:401,82611,886,4083,360,0001,207,0002,113,536
10Jun 15, 2026 16:401,83311,989,8713,382,0001,202,0002,113,536
11Sep 5, 2026 03:591,83612,869,0883,391,0001,201,0002,113,536
12Jun 15, 2026 16:401,86411,967,5233,453,0001,208,0002,113,536