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 listFeb 3, 2025 08:57Andrey LikhachevAndrey LikhachevScore: 33,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 08:5733,022108,292,84375,508,0007,047,0002,531,328
2Feb 3, 2025 08:5733,151110,349,47573,891,0008,986,0002,523,136
3Feb 3, 2025 08:5733,552111,044,77773,896,0009,985,0002,424,832
4Feb 3, 2025 08:5733,721105,480,61976,274,0008,028,0002,273,280
5Feb 3, 2025 08:5733,735114,013,31576,305,0008,032,0002,273,280
6Feb 3, 2025 08:5733,781107,614,41975,405,0009,048,0002,273,280
7Feb 3, 2025 08:5733,792106,435,26976,436,0008,045,0002,424,832
8Feb 3, 2025 08:5733,818113,400,81078,506,0006,038,0002,441,216
9Feb 3, 2025 08:5734,143110,624,65074,311,00011,046,0002,531,328