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:00Josu San MartinJosu San MartinScore: 27,428Success
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:0027,41996,356,81657,459,00011,088,0002,519,040
2Dec 29, 2025 16:0027,42892,173,81162,521,0006,050,0002,514,944
3Dec 29, 2025 16:0027,54495,431,70361,875,0006,985,0002,314,240