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 17:11Yuriy LyfenkoYuriy LyfenkoScore: 25,016Success
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 17:1124,85288,699,26060,126,0002,004,0002,281,472
2Nov 17, 2025 17:1125,01683,806,56560,523,0002,017,0002,277,376
3Nov 17, 2025 17:1125,03483,296,25060,566,0002,018,0002,289,664