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:14olliecrowolliecrowScore: 8,764Success
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:148,76047,423,68517,919,0003,982,0002,494,464
2Mar 12, 2026 03:148,76448,776,69719,918,0001,991,0002,387,968
3Mar 12, 2026 03:148,84644,415,17619,100,0003,015,0002,379,776