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 14, 2026 07:23Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 22:51Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 00:05012,964,4923,079,0001,439,0002,117,632pos 10: expected 0 got 255
2Sep 5, 2026 00:05012,802,0843,098,0001,213,0002,117,632pos 28: expected 0 got 255
3Sep 5, 2026 00:051,71912,736,6943,090,0001,209,0002,117,632
4Jun 14, 2026 07:371,76011,841,5813,150,0001,252,0002,117,632
5Jun 14, 2026 07:371,76111,917,1693,166,0001,238,0002,117,632
6Jun 14, 2026 07:371,77411,975,2053,121,0001,314,0002,117,632
7Jun 14, 2026 07:371,78612,028,9033,131,0001,334,0002,117,632
8Jun 14, 2026 07:371,84212,147,8593,346,0001,259,0002,117,632
9Jun 14, 2026 07:371,84412,061,4753,362,0001,248,0002,117,632
10Jun 14, 2026 07:371,87612,321,3713,436,0001,256,0002,117,632
11Jun 14, 2026 07:371,95412,371,5693,414,0001,473,0002,117,632
12Jun 14, 2026 07:371,96812,447,1773,437,0001,484,0002,117,632