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 23, 2025 05:17Josu San MartinJosu San MartinScore: 30,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 05:1730,432105,100,41171,076,0005,005,0002,318,336
2Dec 23, 2025 05:1730,741102,137,15165,874,00010,979,0002,433,024
3Dec 23, 2025 05:1730,767106,360,29267,928,0008,990,0002,310,144