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 21:56Jacob McDanielJacob McDanielScore: 2,516Success
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 21:562,42017,127,6704,917,0001,133,0002,117,632
2May 21, 2026 21:562,44718,494,4384,903,0001,215,0002,117,632
3May 21, 2026 21:562,44917,107,5544,924,0001,200,0002,117,632
4May 21, 2026 21:562,49117,526,4945,001,0001,228,0002,117,632
5May 21, 2026 21:562,51617,390,7585,045,0001,245,0002,117,632
6May 21, 2026 21:562,53616,592,5845,097,0001,243,0002,117,632
7May 21, 2026 21:562,53716,094,1025,084,0001,260,0002,117,632
8May 21, 2026 21:562,58815,930,0705,184,0001,286,0002,117,632
9May 21, 2026 21:562,60217,454,0135,213,0001,294,0002,117,632