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:56Yuriy LyfenkoYuriy LyfenkoScore: 4,042Success
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:564,00927,966,1597,016,0003,007,0002,363,392
2Nov 18, 2025 21:564,01625,889,6359,036,0001,004,0002,359,296
3Nov 18, 2025 21:574,01931,695,7107,033,0003,014,0002,371,584
4Nov 18, 2025 21:574,02530,423,8809,056,0001,006,0002,355,200
5Nov 18, 2025 21:564,03029,118,8227,052,0003,022,0002,371,584
6Nov 18, 2025 21:564,03632,557,1537,064,0003,027,0002,338,816
7Nov 18, 2025 21:564,04226,024,3199,094,0001,010,0002,334,720
8Nov 18, 2025 21:564,05731,341,0498,115,0002,028,0002,359,296
9Nov 18, 2025 21:564,08333,013,1198,167,0002,041,0002,334,720
10Nov 18, 2025 21:564,14925,864,8959,335,0001,037,0002,473,984
11Nov 18, 2025 21:574,15932,151,4187,278,0003,119,0002,416,640
12Nov 18, 2025 21:564,25225,706,4788,504,0002,126,0002,310,144