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 4, 2026 18:26olliecrowolliecrowScore: 24,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 18:2624,39587,013,83556,989,0003,999,0002,457,600
2Mar 4, 2026 18:2624,45085,472,45057,116,0004,008,0002,318,336
3Mar 4, 2026 18:2624,47883,910,55456,180,0005,016,0002,318,336