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:10Josu San MartinJosu San MartinScore: 27,396Success
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:1027,278100,984,38859,169,0009,025,0002,514,944
2Dec 29, 2025 16:1027,39699,240,90561,440,0007,050,0002,502,656
3Dec 29, 2025 16:1027,784100,172,82164,427,0005,033,0002,273,280