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:54Andrey LikhachevAndrey LikhachevScore: 38,889Success
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:5438,226118,776,34687,517,0008,047,0002,387,968
2Feb 3, 2025 08:5438,662126,387,42191,674,0004,982,0002,273,280
3Feb 3, 2025 08:5438,707123,190,50087,790,0008,978,0002,527,232
4Feb 3, 2025 08:5438,798125,557,62387,996,0008,999,0002,527,232
5Feb 3, 2025 08:5438,889126,056,82887,200,00010,023,0002,433,024
6Feb 3, 2025 08:5438,918122,514,95191,276,0006,018,0002,494,464
7Feb 3, 2025 08:5439,189127,532,75287,976,0009,997,0002,523,136
8Feb 3, 2025 08:5439,333126,425,85189,303,0009,030,0002,527,232
9Feb 3, 2025 08:5439,676124,496,35290,262,0008,927,0002,527,232