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 listDec 3, 2023 20:07Sergey StreminSergey StreminScore: 62,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2023 20:0761,851183,848,029149,607,0005,020,0002,449,408
2Dec 3, 2023 20:0761,904216,546,796154,760,55402,195,456
3Dec 3, 2023 20:0762,056182,354,103149,136,0006,005,0002,387,968
4Dec 3, 2023 20:0762,110183,796,536149,264,0006,010,0002,306,048
5Dec 3, 2023 20:0762,110183,982,654148,264,0007,012,0002,293,760
6Dec 3, 2023 20:0762,129182,946,516147,307,0008,016,0002,412,544
7Dec 3, 2023 20:0762,229185,355,296149,551,0006,022,0002,269,184
8Dec 3, 2023 20:0762,310183,249,024152,779,0002,995,0002,416,640
9Dec 3, 2023 20:0762,316183,560,432151,796,0003,994,0002,506,752
10Dec 3, 2023 20:0762,616219,012,856156,540,63102,269,184
11Dec 3, 2023 20:0762,711183,529,603154,781,0001,997,0002,277,376
12Dec 3, 2023 20:0763,807225,712,207159,518,58602,310,144