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 15, 2026 07:19Elijah KinElijah KinScore: 29,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 07:1929,846103,311,76169,574,0005,041,0002,293,760
2Mar 15, 2026 07:1929,86399,289,97969,614,0005,044,0002,359,296
3Mar 15, 2026 07:1930,018103,026,98471,044,0004,002,0002,314,240