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 18, 2025 22:05Yuriy LyfenkoYuriy LyfenkoScore: 4,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2025 22:054,01432,809,6227,024,0003,010,0002,330,624
2Nov 18, 2025 22:054,03229,630,9638,064,0002,016,0002,371,584
3Nov 18, 2025 22:054,03724,047,7488,075,0002,018,0002,375,680
4Nov 18, 2025 22:054,04732,147,2177,082,0003,035,0002,330,624
5Nov 18, 2025 22:054,13229,148,5887,232,0003,099,0002,404,352
6Nov 18, 2025 22:054,18025,942,5326,270,0004,180,0002,379,776