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 listJan 1, 2026 16:39Josu San MartinJosu San MartinScore: 30,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 05:3130,335107,524,66172,845,0002,993,0002,506,752
2Dec 30, 2025 05:3130,426106,239,73371,061,0005,004,0002,506,752
3Jan 1, 2026 16:3930,449101,955,55571,115,0005,008,0002,514,944
4Jan 1, 2026 16:3930,517101,085,66672,277,0004,015,0002,514,944
5Dec 30, 2025 05:3130,613101,405,87272,505,0004,028,0002,502,656
6Jan 1, 2026 16:3930,940106,141,45373,332,0004,018,0002,510,848