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,862Success
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,73036,154,80822,184,0002,143,0002,113,536
2May 17, 2026 06:119,78033,550,80922,311,0002,139,0002,113,536
3May 17, 2026 06:119,80735,719,88522,347,0002,171,0002,113,536
4May 17, 2026 06:119,81035,557,12122,211,0002,314,0002,113,536
5May 17, 2026 06:119,86235,293,93322,467,0002,190,0002,113,536
6May 17, 2026 06:119,87934,057,22622,558,0002,141,0002,113,536
7May 17, 2026 06:119,89034,851,70122,527,0002,198,0002,113,536
8May 17, 2026 06:119,92335,522,87422,638,0002,170,0002,113,536
9May 17, 2026 06:1110,82447,580,84524,820,0002,241,0002,113,536