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 17, 2026 06:10Jacob McDanielJacob McDanielScore: 9,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:119,26138,698,29120,996,0002,158,0002,113,536
2May 17, 2026 06:119,26133,361,56020,969,0002,185,0002,113,536
3May 17, 2026 06:119,32535,164,45421,156,0002,157,0002,113,536
4May 17, 2026 06:119,35432,429,83621,255,0002,131,0002,113,536
5May 17, 2026 06:119,38433,690,34621,307,0002,154,0002,113,536
6May 17, 2026 06:119,39532,433,52821,346,0002,143,0002,113,536
7May 17, 2026 06:119,42433,264,99821,344,0002,216,0002,113,536
8May 17, 2026 06:119,46133,968,04921,475,0002,178,0002,113,536
9May 17, 2026 06:119,51234,697,26121,621,0002,159,0002,113,536