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 29, 2025 16:06Josu San MartinJosu San MartinScore: 27,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 16:0627,344101,071,76260,317,0008,042,0002,514,944
2Dec 29, 2025 16:0627,40398,088,33162,463,0006,044,0002,277,376
3Dec 29, 2025 16:0627,56599,894,71258,925,0009,987,0002,285,568