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 listMay 21, 2026 18:58Jacob McDanielJacob McDanielScore: 2,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:582,44416,320,5104,913,0001,199,0002,117,632
2May 21, 2026 18:582,45815,633,3044,944,0001,201,0002,117,632
3May 21, 2026 18:582,47618,051,6684,974,0001,218,0002,117,632
4May 21, 2026 18:582,48315,966,5274,989,0001,220,0002,117,632
5May 21, 2026 18:582,51618,180,8065,048,0001,243,0002,117,632
6May 21, 2026 18:582,56416,134,5805,125,0001,287,0002,117,632
7May 21, 2026 18:582,56618,663,7495,153,0001,263,0002,117,632
8May 21, 2026 18:582,58116,124,1195,172,0001,281,0002,117,632
9May 21, 2026 18:582,58517,614,7545,168,0001,295,0002,117,632