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 listMar 19, 2026 09:05Dominique GarmierDominique GarmierScore: 8,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 09:058,84749,187,62116,086,0006,032,0002,371,584
2Mar 19, 2026 09:058,85845,878,01516,106,0006,039,0002,285,568
3Mar 19, 2026 09:058,89543,311,79616,173,0006,065,0002,342,912
4Mar 19, 2026 09:058,90046,815,43520,227,0002,022,0002,285,568
5Mar 19, 2026 09:058,91844,727,02119,254,0003,040,0002,306,048
6Mar 19, 2026 09:059,04349,904,55017,470,0005,138,0002,273,280
7Mar 19, 2026 09:059,06947,670,06919,582,0003,091,0002,277,376
8Mar 19, 2026 09:059,09951,770,35016,813,0005,934,0002,310,144
9Mar 19, 2026 09:059,15651,935,19418,910,0003,981,0002,482,176