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 listNov 17, 2025 06:21Yuriy LyfenkoYuriy LyfenkoScore: 39,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2025 06:2138,897123,174,21290,225,0007,017,0002,322,432
2Nov 17, 2025 06:2139,057121,879,25490,597,0007,046,0002,433,024
3Nov 17, 2025 06:2139,119124,988,66390,813,0006,985,0002,473,984