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 6, 2026 20:02olliecrowolliecrowScore: 28,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 20:0228,34894,259,19569,872,000998,0002,506,752
2Apr 6, 2026 20:0228,46194,976,69169,148,0002,004,0002,523,136
3Apr 6, 2026 20:0228,64694,768,35770,607,0001,008,0002,506,752