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 listApr 17, 2026 01:25olliecrowolliecrowScore: 4,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 01:254,45829,864,58210,132,0001,013,0002,482,176
2Apr 17, 2026 01:254,70035,473,7668,546,0003,205,0002,379,776
3Apr 17, 2026 01:254,86345,980,20511,144,0001,013,0002,486,272