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 6, 2026 01:41Josu San MartinJosu San MartinScore: 5,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 01:415,43830,877,6459,412,0004,183,0002,469,888
2Feb 6, 2026 01:415,45633,776,73911,541,0002,098,0002,285,568
3Feb 6, 2026 01:415,53231,026,8289,878,0003,951,0002,453,504