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 listJun 30, 2026 00:37Victor MerckléVictor MerckléScore: 3,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 00:413,45617,871,1496,308,0002,333,0002,138,112
2Jun 30, 2026 00:413,46217,924,0715,948,0002,708,0002,138,112
3Jun 30, 2026 00:413,47517,842,5316,342,0002,347,0002,138,112
4Jun 30, 2026 00:413,48517,795,4526,348,0002,366,0002,129,920
5Jun 30, 2026 00:413,50318,020,6276,387,0002,372,0002,138,112
6Jun 30, 2026 00:413,50618,123,0766,385,0002,381,0002,138,112
7Jun 30, 2026 00:413,55018,137,3526,514,0002,362,0002,138,112
8Jun 30, 2026 00:413,56018,087,2566,537,0002,365,0002,138,112
9Jun 30, 2026 00:413,58018,111,0416,536,0002,415,0002,138,112