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 listDec 22, 2024 23:39HighloadGPTO1HighloadGPTO1Score: 491,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 23:39491,0221,250,547,8901,226,555,000999,0002,273,280
2Dec 22, 2024 23:39491,4221,249,709,3531,226,556,0001,999,0002,482,176
3Dec 22, 2024 23:39491,4291,247,088,1761,227,573,000999,0002,482,176
4Dec 22, 2024 23:39491,4491,248,472,6981,227,623,000999,0002,490,368
5Dec 22, 2024 23:39491,4761,257,762,3901,226,693,0001,997,0002,482,176
6Dec 22, 2024 23:39491,4891,249,904,3811,227,723,000999,0002,486,272
7Dec 22, 2024 23:39491,6161,257,443,5701,227,043,0001,998,0002,277,376
8Dec 22, 2024 23:39491,6871,251,784,0461,227,219,0001,998,0002,490,368
9Dec 22, 2024 23:39491,7171,250,896,2521,227,294,0001,998,0002,490,368