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 listOct 9, 2026 08:48Karthik ReddyKarthik ReddyScore: 1,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 09:501,23211,790,3221,839,0001,243,000524,288
2Oct 9, 2026 09:501,23411,856,7461,842,0001,244,000524,288
3Oct 9, 2026 09:501,23511,868,2171,600,0001,489,000524,288
4Oct 9, 2026 09:501,23611,979,2771,845,0001,245,000524,288
5Oct 9, 2026 09:501,23711,996,9121,861,0001,233,000524,288
6Oct 9, 2026 09:501,24811,918,8121,877,0001,243,000524,288
7Oct 9, 2026 09:501,29612,014,7941,924,0001,318,000524,288
8Oct 9, 2026 09:501,35612,063,7292,273,0001,118,000524,288
9Oct 9, 2026 09:501,46412,433,2552,543,0001,118,000524,288