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 listJun 7, 2026 15:55Elijah KinElijah KinScore: 2,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 15:562,24914,642,0554,504,0001,119,0002,117,632
2Jun 7, 2026 15:562,26014,775,5324,534,0001,116,0002,117,632
3Jun 7, 2026 15:562,29514,840,5204,622,0001,117,0002,117,632
4Jun 7, 2026 15:562,32614,910,5584,699,0001,118,0002,117,632
5Jun 7, 2026 15:562,35715,057,3984,780,0001,114,0002,117,632
6Jun 7, 2026 15:562,40115,028,9154,891,0001,113,0002,117,632
7Jun 7, 2026 15:562,47715,191,8785,092,0001,102,0002,117,632
8Jun 7, 2026 15:562,47815,223,8375,090,0001,106,0002,117,632
9Jun 7, 2026 15:562,48615,267,8505,109,0001,108,0002,117,632