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 17, 2023 08:46matsuoka-601matsuoka-601Score: 4,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2023 08:464,04165,841,11410,102,17902,260,992
2Jul 17, 2023 08:464,11467,404,90410,284,50502,260,992
3Jul 17, 2023 08:464,14872,185,62210,368,89902,260,992
4Jul 17, 2023 08:464,20331,224,4356,304,0004,203,0002,453,504
5Jul 17, 2023 08:464,21427,637,4065,268,0005,268,0002,408,448
6Jul 17, 2023 08:464,25525,752,7307,447,0003,191,0002,330,624
7Jul 17, 2023 08:464,26933,559,0575,336,0005,336,0002,363,392
8Jul 17, 2023 08:464,34132,306,4609,768,0001,085,0002,412,544
9Jul 17, 2023 08:464,35828,330,8395,943,0004,952,0002,293,760
10Jul 17, 2023 08:464,39632,895,0477,993,0002,997,0002,408,448
11Jul 17, 2023 08:464,41734,951,2277,027,0004,015,0002,297,856
12Jul 17, 2023 08:464,44833,550,5814,044,0007,077,0002,351,104