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 10, 2026 05:42Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 01:38Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 03:24014,879,5793,678,0002,390,0002,113,536pos 32: expected 0 got 255
2Sep 5, 2026 03:242,38214,350,6923,582,0002,374,0002,113,536
3Jun 10, 2026 05:522,47013,853,7313,884,0002,291,0002,113,536
4Jun 10, 2026 05:522,47213,734,7513,861,0002,320,0002,113,536
5Jun 10, 2026 05:522,50113,776,8374,029,0002,224,0002,113,536
6Jun 10, 2026 05:522,50113,808,2973,360,0002,893,0002,113,536
7Jun 10, 2026 05:522,52913,796,1413,689,0002,634,0002,113,536
8Jun 10, 2026 05:522,53613,828,3233,680,0002,662,0002,113,536
9Jun 10, 2026 05:522,55013,871,7743,747,0002,630,0002,113,536
10Jun 10, 2026 05:522,55913,965,7263,589,0002,809,0002,113,536
11Sep 5, 2026 03:242,57114,850,2743,686,0002,742,0002,113,536
12Jun 10, 2026 05:522,60913,991,4513,754,0002,769,0002,113,536