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 listJul 12, 2023 17:33Bernard TeoBernard TeoScore: 35,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 17:3335,378113,101,55488,444,00002,314,240
2Jul 12, 2023 17:3335,383122,560,19387,453,0001,005,0002,396,160
3Jul 12, 2023 17:3335,397110,850,16788,492,00002,330,624
4Jul 12, 2023 17:3335,422114,555,86888,554,00002,392,064
5Jul 12, 2023 17:3335,449114,191,27487,615,0001,007,0002,396,160
6Jul 12, 2023 17:3335,453106,162,94287,626,0001,007,0002,314,240
7Jul 12, 2023 17:3335,504109,742,22487,763,000997,0002,314,240
8Jul 12, 2023 17:3335,547119,660,13787,869,000998,0002,330,624
9Jul 12, 2023 17:3335,814110,897,04089,534,00002,330,624
10Jul 12, 2023 17:3336,849156,182,00792,121,29102,248,704
11Jul 12, 2023 17:3336,859158,032,97192,148,40802,256,896
12Jul 12, 2023 17:3336,887155,632,85892,216,53902,248,704