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 listJun 29, 2025 22:32Aniruddha DebAniruddha DebScore: 6,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2025 22:326,86035,913,38913,115,0004,035,0002,519,040
2Jun 29, 2025 22:326,92139,706,35513,231,0004,071,0002,273,280
3Jun 29, 2025 22:326,93342,178,17613,255,0004,078,0002,347,008
4Jun 29, 2025 22:326,94845,043,34613,284,0004,087,0002,260,992
5Jun 29, 2025 22:326,95140,811,94112,266,0005,111,0002,519,040
6Jun 29, 2025 22:326,95632,512,86214,322,0003,069,0002,289,664
7Jun 29, 2025 22:326,96448,952,29412,289,0005,120,0002,265,088
8Jun 29, 2025 22:327,05244,892,84216,592,0001,037,0002,519,040
9Jun 29, 2025 22:327,16247,785,26315,915,0001,989,0002,510,848