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:28olliecrowolliecrowScore: 4,937Success
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:284,92028,603,1969,225,0003,075,0002,486,272
2Apr 17, 2026 01:284,93730,744,9208,228,0004,114,0002,379,776
3Apr 17, 2026 01:284,95730,121,8718,262,0004,131,0002,473,984