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 listJan 4, 2024 12:23Andrey LikhachevAndrey LikhachevScore: 46,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2024 12:2346,809141,254,145115,023,0002,000,000786,432
2Jan 4, 2024 12:2346,813144,926,991115,033,0002,000,000778,240
3Jan 4, 2024 12:2346,821143,903,202115,052,0002,000,000774,144
4Jan 4, 2024 12:2346,821147,313,987116,053,0001,000,000700,416
5Jan 4, 2024 12:2346,826143,342,957115,063,0002,001,000782,336
6Jan 4, 2024 12:2346,828141,320,956115,070,0002,001,000700,416
7Jan 4, 2024 12:2346,843143,746,020115,107,0002,001,000700,416
8Jan 4, 2024 12:2346,848145,108,118116,120,0001,001,000778,240
9Jan 4, 2024 12:2346,849143,692,726115,121,0002,002,000700,416
10Jan 4, 2024 12:2346,853175,212,925117,133,55002,211,840
11Jan 4, 2024 12:2346,882213,234,002117,204,18902,195,456
12Jan 4, 2024 12:2346,890186,272,828117,224,44802,211,840