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 listNov 18, 2025 21:08Yuriy LyfenkoYuriy LyfenkoScore: 4,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2025 21:073,98525,308,8766,974,0002,988,0002,334,720
2Nov 18, 2025 21:014,00925,714,0388,018,0002,004,0002,416,640
3Nov 18, 2025 21:074,00925,237,7777,016,0003,007,0002,420,736
4Nov 18, 2025 21:014,01227,382,7917,022,0003,009,0002,437,120
5Nov 18, 2025 21:014,01527,232,4107,027,0003,011,0002,420,736
6Nov 18, 2025 21:014,01627,227,3706,024,0004,016,0002,416,640
7Nov 18, 2025 21:074,01828,194,9588,036,0002,009,0002,367,488
8Nov 18, 2025 21:074,01825,983,7047,032,0003,013,0002,310,144
9Nov 18, 2025 21:074,02526,045,6608,051,0002,012,0002,338,816
10Nov 18, 2025 21:074,02727,301,7017,048,0003,020,0002,482,176
11Nov 18, 2025 21:084,06125,733,0117,107,0003,046,0002,420,736
12Nov 18, 2025 21:074,13726,210,9467,240,0003,103,0002,367,488
13Nov 18, 2025 21:014,13827,280,0518,277,0002,069,0002,326,528
14Nov 18, 2025 21:074,14626,029,5329,328,0001,036,0002,367,488
15Nov 18, 2025 21:014,14726,117,9637,257,0003,110,0002,375,680
16Nov 18, 2025 21:014,14833,359,7277,259,0003,111,0002,412,544
17Nov 18, 2025 21:014,15227,847,2857,267,0003,114,0002,371,584
18Nov 18, 2025 21:084,15228,069,2368,304,0002,076,0002,420,736
19Nov 18, 2025 21:074,17025,396,2227,297,0003,127,0002,449,408
20Nov 18, 2025 21:084,17627,258,9797,309,0003,132,0002,338,816
21Nov 18, 2025 21:014,19128,695,1057,334,0003,143,0002,363,392