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 12, 2026 03:40olliecrowolliecrowScore: 8,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 03:408,56344,978,37419,370,0002,038,0002,445,312
2Mar 12, 2026 03:408,59042,750,93020,453,0001,022,0002,306,048
3Mar 12, 2026 03:408,60248,088,04018,434,0003,072,0002,445,312
4Mar 12, 2026 03:408,60748,666,37219,468,0002,049,0002,506,752
5Mar 12, 2026 03:408,61355,787,78519,483,0002,050,0002,342,912
6Mar 12, 2026 03:408,61646,419,42119,490,0002,051,0002,433,024
7Mar 12, 2026 03:408,62848,060,30019,516,0002,054,0002,445,312
8Mar 12, 2026 03:408,63442,317,97019,529,0002,055,0002,506,752
9Mar 12, 2026 03:408,79948,377,06519,998,0001,999,0002,445,312