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:44Jacob McDanielJacob McDanielScore: 2,505Success
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:452,48218,393,5385,060,0001,145,0002,117,632
2May 21, 2026 18:452,48817,631,8235,025,0001,195,0002,117,632
3May 21, 2026 18:452,48916,414,2925,023,0001,201,0002,117,632
4May 21, 2026 18:452,48916,286,7105,026,0001,198,0002,117,632
5May 21, 2026 18:452,50516,704,5865,056,0001,207,0002,117,632
6May 21, 2026 18:452,60718,441,8565,254,0001,264,0002,117,632
7May 21, 2026 18:452,61217,303,8505,246,0001,284,0002,117,632
8May 21, 2026 18:452,62217,768,4195,283,0001,273,0002,117,632
9May 21, 2026 18:452,62518,131,7745,296,0001,268,0002,117,632