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:57Yuriy LyfenkoYuriy LyfenkoScore: 24,893Success
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:5724,82689,200,35160,064,0002,002,0002,293,760
2Nov 17, 2025 06:5724,85494,005,40161,132,0001,002,0002,404,352
3Nov 17, 2025 06:5724,87690,997,73459,182,0003,009,0002,273,280
4Nov 17, 2025 06:5724,87793,451,16161,189,0001,003,0002,416,640
5Nov 17, 2025 06:5724,89390,954,19560,226,0002,007,0002,465,792
6Nov 17, 2025 06:5724,89489,036,84260,227,0002,007,0002,277,376
7Nov 17, 2025 06:5724,99687,947,34659,467,0003,023,0002,277,376
8Nov 17, 2025 06:5725,06391,273,45060,637,0002,021,0002,293,760
9Nov 17, 2025 06:5725,29390,094,40361,225,0002,007,0002,277,376