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 listSep 15, 2026 04:59Victor MerckléVictor MerckléScore: 1,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 05:001,39012,375,7601,937,0001,538,0002,117,632stderr
2Sep 15, 2026 05:001,42912,417,7642,045,0001,528,0002,117,632stderr
3Sep 15, 2026 05:001,45312,489,6222,093,0001,541,0002,117,632stderr
4Sep 15, 2026 05:001,46712,427,1342,117,0001,551,0002,117,632stderr
5Sep 15, 2026 05:001,47012,668,5372,117,0001,560,0002,117,632stderr
6Sep 15, 2026 05:001,47212,393,9832,117,0001,565,0002,117,632stderr
7Sep 15, 2026 05:001,50012,468,5042,157,0001,595,0002,117,632stderr
8Sep 15, 2026 05:001,50213,126,4922,154,0001,602,0002,117,632stderr
9Sep 15, 2026 05:001,51012,437,3942,599,0001,177,0002,117,632stderr