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 18, 2026 08:09Jacob McDanielJacob McDanielScore: 3,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 08:183,42219,642,3206,489,0002,067,0002,121,728
2May 18, 2026 08:183,42619,758,1616,486,0002,081,0002,121,728
3May 18, 2026 08:183,43720,636,2506,511,0002,082,0002,121,728
4May 18, 2026 08:183,44018,296,6986,509,0002,093,0002,113,536
5May 18, 2026 08:183,52318,127,5956,669,0002,139,0002,117,632
6May 18, 2026 08:183,54620,084,7436,713,0002,153,0002,121,728
7May 18, 2026 08:183,55320,213,3596,720,0002,164,0002,117,632
8May 18, 2026 08:183,57020,784,8836,750,0002,177,0002,121,728
9May 18, 2026 08:183,59219,282,2776,808,0002,172,0002,113,536