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 listFeb 5, 2026 04:45Josu San MartinJosu San MartinScore: 5,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 04:455,44431,518,43311,517,0002,094,0002,527,232
2Feb 5, 2026 04:455,45637,798,34912,592,0001,049,0002,527,232
3Feb 5, 2026 04:455,46132,358,60412,602,0001,050,0002,342,912
4Feb 5, 2026 04:455,46637,192,91911,562,0002,102,0002,531,328
5Feb 5, 2026 04:455,47632,071,15611,584,0002,106,0002,396,160
6Feb 5, 2026 04:455,47931,715,98311,590,0002,107,0002,392,064
7Feb 5, 2026 04:455,48245,137,33911,597,0002,108,0002,527,232
8Feb 5, 2026 04:455,50328,607,7729,525,0004,233,0002,301,952
9Feb 5, 2026 04:455,59841,197,6759,996,0003,998,0002,400,256