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 9, 2023 22:21gchebanovgchebanovScore: 22,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 22:2120,169121,725,05350,422,15102,408,448
2Jul 9, 2023 22:2120,605119,302,56551,511,55802,273,280
3Jul 9, 2023 22:2120,625107,344,66151,562,56202,277,376
4Jul 9, 2023 22:2121,70487,916,65746,221,0008,038,0002,289,664
5Jul 9, 2023 22:2121,70478,927,15445,217,0009,043,0002,494,464
6Jul 9, 2023 22:2122,10177,004,79047,216,0008,036,0002,355,200
7Jul 9, 2023 22:2122,10478,799,80347,222,0008,037,0002,289,664
8Jul 9, 2023 22:2122,12682,404,12247,270,0008,046,0002,306,048
9Jul 9, 2023 22:2122,15277,495,66548,332,0007,048,0002,469,888
10Jul 9, 2023 22:2122,35483,894,61847,902,0007,983,0002,445,312
11Jul 9, 2023 22:2122,42380,494,28449,051,0007,007,0002,306,048
12Jul 9, 2023 22:2122,82182,053,19749,046,0008,007,0002,293,760