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 listJan 16, 2026 02:37Josu San MartinJosu San MartinScore: 12,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 02:3712,26155,829,31824,522,0006,130,0002,383,872
2Jan 16, 2026 02:3712,36458,154,24323,930,0006,979,0002,379,776
3Jan 16, 2026 02:3712,36457,090,16624,927,0005,982,0002,371,584