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 listApr 13, 2026 08:22limanjun99limanjun99Score: 3,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 08:223,40624,053,2486,386,0002,128,0002,289,664
2Apr 13, 2026 08:223,42128,512,5685,345,0003,207,0002,453,504
3Apr 13, 2026 08:223,42727,303,4827,497,0001,071,0002,449,408
4Apr 13, 2026 08:223,43130,514,7726,433,0002,144,0002,318,336
5Apr 13, 2026 08:223,44424,456,0796,458,0002,152,0002,506,752
6Apr 13, 2026 08:223,45828,828,4345,403,0003,241,0002,285,568
7Apr 13, 2026 08:223,47930,231,3175,436,0003,261,0002,289,664
8Apr 13, 2026 08:223,50128,494,2706,565,0002,188,0002,510,848
9Apr 13, 2026 08:223,56731,978,8905,945,0002,972,0002,531,328