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 listAug 29, 2026 09:25Victor MerckléVictor MerckléScore: 1,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 09:271,57912,280,8552,821,0001,128,0002,117,632stderr
2Aug 29, 2026 09:271,58812,323,3052,820,0001,150,0002,117,632stderr
3Aug 29, 2026 09:271,59012,343,3542,812,0001,165,0002,117,632stderr
4Aug 29, 2026 09:271,59212,328,9462,833,0001,147,0002,117,632stderr
5Aug 29, 2026 09:271,59612,282,7922,836,0001,154,0002,117,632stderr
6Aug 29, 2026 09:271,60112,366,7152,843,0001,160,0002,117,632stderr
7Aug 29, 2026 09:271,61712,375,2352,869,0001,175,0002,117,632stderr
8Aug 29, 2026 09:271,70212,661,6783,047,0001,208,0002,117,632stderr
9Aug 29, 2026 09:271,74412,846,2063,191,0001,170,0002,117,632stderr