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 listJun 29, 2025 22:37Aniruddha DebAniruddha DebScore: 6,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2025 22:376,53537,890,79812,254,0004,084,0002,416,640
2Jun 29, 2025 22:376,53538,900,69013,275,0003,063,0002,306,048
3Jun 29, 2025 22:366,55439,021,83012,290,0004,096,0002,416,640
4Jun 29, 2025 22:366,55930,856,70413,324,0003,074,0002,412,544
5Jun 29, 2025 22:366,56038,357,77213,326,0003,075,0002,293,760
6Jun 29, 2025 22:366,56038,357,65612,300,0004,100,0002,297,856
7Jun 29, 2025 22:376,56343,771,38713,332,0003,076,0002,412,544
8Jun 29, 2025 22:376,57142,826,40311,294,0005,133,0002,392,064
9Jun 29, 2025 22:366,58048,541,79311,310,0005,141,0002,412,544
10Jun 29, 2025 22:366,58133,153,91415,424,0001,028,0002,412,544
11Jun 29, 2025 22:376,58238,210,29115,427,0001,028,0002,498,560
12Jun 29, 2025 22:366,59634,925,49011,337,0005,153,0002,420,736
13Jun 29, 2025 22:366,59836,177,83312,613,0003,881,0002,412,544
14Jun 29, 2025 22:366,59934,218,09812,374,0004,124,0002,449,408
15Jun 29, 2025 22:376,61038,409,38012,394,0004,131,0002,416,640
16Jun 29, 2025 22:376,64444,074,77313,495,0003,114,0002,371,584
17Jun 29, 2025 22:376,76044,767,80712,923,0003,976,0002,404,352
18Jun 29, 2025 22:378,07141,290,63315,133,0005,044,0002,416,640