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:31Jacob McDanielJacob McDanielScore: 2,539Success
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:312,41416,383,1134,854,0001,182,0002,117,632
2May 21, 2026 18:312,43317,099,5394,944,0001,140,0002,117,632
3May 21, 2026 18:312,49416,127,5925,006,0001,229,0002,117,632
4May 21, 2026 18:312,50515,524,6865,066,0001,198,0002,117,632
5May 21, 2026 18:312,53917,568,2305,099,0001,250,0002,117,632
6May 21, 2026 18:312,54815,753,2455,111,0001,261,0002,113,536
7May 21, 2026 18:312,56417,830,6995,141,0001,271,0002,117,632
8May 21, 2026 18:312,57316,672,6955,158,0001,275,0002,117,632
9May 21, 2026 18:312,64618,041,9225,326,0001,291,0002,117,632