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:33Jacob McDanielJacob McDanielScore: 2,606Success
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:342,49018,566,0475,024,0001,202,0002,117,632
2May 21, 2026 18:342,49515,548,1945,036,0001,202,0002,117,632
3May 21, 2026 18:342,50217,005,8535,059,0001,196,0002,117,632
4May 21, 2026 18:342,55216,427,3585,154,0001,226,0002,117,632
5May 21, 2026 18:342,60615,752,3205,247,0001,268,0002,117,632
6May 21, 2026 18:342,61116,767,6755,256,0001,272,0002,117,632
7May 21, 2026 18:342,62817,431,9265,316,0001,256,0002,117,632
8May 21, 2026 18:342,66016,364,8935,366,0001,286,0002,117,632
9May 21, 2026 18:342,67016,683,0745,399,0001,278,0002,117,632