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 02:11olliecrowolliecrowScore: 5,338Success
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 02:115,08742,148,8349,538,0003,179,0002,437,120
2Apr 17, 2026 02:115,33843,457,10910,265,0003,079,0002,404,352
3Apr 17, 2026 02:115,41628,142,35910,416,0003,124,0002,424,832