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 listJul 1, 2025 20:01Aniruddha DebAniruddha DebScore: 6,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2025 20:016,49234,497,93012,173,0004,057,0002,322,432
2Jul 1, 2025 20:016,51431,641,62212,214,0004,071,0002,424,832
3Jul 1, 2025 20:016,54237,824,99813,289,0003,066,0002,420,736
4Jul 1, 2025 20:016,55329,008,07412,287,0004,095,0002,416,640
5Jul 1, 2025 20:016,56443,277,05213,334,0003,077,0002,416,640
6Jul 1, 2025 20:016,56635,391,90113,337,0003,077,0002,416,640
7Jul 1, 2025 20:016,57038,891,75813,345,0003,079,0002,502,656
8Jul 1, 2025 20:016,60032,349,94513,406,0003,093,0002,416,640
9Jul 1, 2025 20:017,17643,791,59412,956,0004,983,0002,523,136