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:08Josu San MartinJosu San MartinScore: 27,370Success
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:0827,33998,540,40260,307,0008,040,0002,531,328
2Dec 29, 2025 16:0827,37092,903,18262,387,0006,037,0002,506,752
3Dec 29, 2025 16:0827,38595,037,29159,402,0009,061,0002,514,944