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:40olliecrowolliecrowScore: 4,764Success
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:404,64628,624,60910,560,0001,056,0002,473,984
2Apr 17, 2026 01:404,76428,985,0436,948,0004,963,0002,334,720
3Apr 17, 2026 01:404,90526,878,2309,197,0003,065,0002,338,816