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:27olliecrowolliecrowScore: 24,618Success
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:2724,58487,797,80858,439,0003,022,0002,318,336
2Mar 4, 2026 18:2724,61889,113,09056,502,0005,044,0002,412,544
3Mar 4, 2026 18:2724,67890,265,66156,639,0005,057,0002,449,408