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 9, 2026 22:56Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 03:41Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 05:01019,914,1897,751,0002,379,0002,129,920pos 10: expected 236 got 235
2Jun 9, 2026 23:003,82518,489,9837,146,0002,418,0002,138,112
3Sep 5, 2026 05:013,89619,804,8026,656,0003,084,0002,150,400
4Sep 5, 2026 05:014,01419,851,8526,884,0003,151,0002,150,400
5Jun 9, 2026 23:004,02718,947,9767,605,0002,463,0002,129,920
6Jun 9, 2026 23:004,03918,814,4707,690,0002,408,0002,129,920
7Jun 9, 2026 23:004,04118,928,3097,697,0002,407,0002,129,920
8Jun 9, 2026 23:004,05418,985,4447,707,0002,430,0002,129,920
9Jun 9, 2026 23:004,05919,111,5727,732,0002,417,0002,134,016
10Jun 9, 2026 23:004,06719,050,7907,776,0002,393,0002,138,112
11Jun 9, 2026 23:004,07619,078,0767,764,0002,428,0002,129,920
12Jun 9, 2026 23:004,08319,121,8126,969,0003,240,0002,183,168