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:31Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:08Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 12:12015,050,7104,234,0002,303,0002,117,632pos 28: expected 0 got 255
2Sep 9, 2026 12:12015,234,7074,523,0002,225,0002,117,632pos 32: expected 0 got 255
3Sep 9, 2026 12:12015,388,2024,589,0002,346,0002,113,536pos 34: expected 0 got 255
4Jun 10, 2026 05:392,65714,120,2564,251,0002,392,0002,113,536
5Jun 10, 2026 05:392,68614,198,5204,529,0002,187,0002,113,536
6Jun 10, 2026 05:392,69014,226,5134,263,0002,462,0002,113,536
7Jun 10, 2026 05:392,69214,196,1734,552,0002,178,0002,113,536
8Jun 10, 2026 05:392,70414,388,4254,572,0002,188,0002,113,536
9Jun 10, 2026 05:392,70614,278,7124,565,0002,202,0002,113,536
10Jun 10, 2026 05:392,71314,433,1784,610,0002,174,0002,113,536
11Jun 10, 2026 05:392,72014,321,1064,526,0002,275,0002,113,536
12Jun 10, 2026 05:392,79014,504,0464,580,0002,396,0002,113,536