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 17, 2025 06:58Yuriy LyfenkoYuriy LyfenkoScore: 24,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2025 06:5824,86391,617,31660,153,0002,005,0002,396,160
2Nov 17, 2025 06:5824,86987,201,40260,167,0002,005,0002,289,664
3Nov 17, 2025 06:5824,87387,744,12060,178,0002,005,0002,379,776
4Nov 17, 2025 06:5824,88794,665,73359,207,0003,010,0002,277,376
5Nov 17, 2025 06:5824,92985,776,43060,312,0002,010,0002,289,664
6Nov 17, 2025 06:5824,94084,866,59659,333,0003,016,0002,293,760
7Nov 17, 2025 06:5824,99389,675,07358,451,0004,031,0002,445,312
8Nov 17, 2025 06:5825,006100,660,76560,500,0002,016,0002,293,760
9Nov 17, 2025 06:5826,11987,577,19263,288,0002,009,0002,273,280