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:09Josu San MartinJosu San MartinScore: 27,408Success
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:0927,32995,735,42161,290,0007,033,0002,359,296
2Dec 29, 2025 16:0927,40893,172,86860,459,0008,061,0002,392,064
3Dec 29, 2025 16:0927,52494,833,76760,832,0007,978,0002,514,944