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:12Yuriy LyfenkoYuriy LyfenkoScore: 39,040Success
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:1238,775128,624,86591,941,0004,996,0002,322,432
2Nov 17, 2025 06:1438,802129,148,63293,006,0004,000,0002,494,464
3Nov 17, 2025 06:1438,837125,216,76689,086,0008,007,0002,445,312
4Nov 17, 2025 06:1438,994129,962,25291,456,0006,030,0002,478,080
5Nov 17, 2025 06:1439,040126,477,19791,564,0006,037,0002,347,008
6Nov 17, 2025 06:1439,134129,804,35390,846,0006,988,0002,293,760
7Nov 17, 2025 06:1439,139121,474,61292,856,0004,992,0002,478,080
8Nov 17, 2025 06:1239,196122,319,34389,992,0007,999,0002,482,176
9Nov 17, 2025 06:1239,218123,751,84090,043,0008,003,0002,482,176