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:02Josu San MartinJosu San MartinScore: 27,400Success
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:0227,387101,290,17562,427,0006,041,0002,519,040
2Dec 29, 2025 16:0227,40096,459,12264,471,0004,029,0002,510,848
3Dec 29, 2025 16:0227,402104,061,03461,454,0007,052,0002,531,328