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 6, 2026 23:41Elijah KinElijah KinScore: 2,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 23:422,25614,766,0994,530,0001,110,0002,117,632
2Jun 6, 2026 23:422,26014,719,5244,537,0001,115,0002,117,632
3Jun 6, 2026 23:422,26614,737,9094,548,0001,118,0002,117,632
4Jun 6, 2026 23:422,27916,345,1364,579,0001,119,0002,117,632
5Jun 6, 2026 23:422,28814,816,4524,602,0001,118,0002,117,632
6Jun 6, 2026 23:422,42415,110,8924,951,0001,111,0002,117,632
7Jun 6, 2026 23:422,48117,181,1895,094,0001,110,0002,117,632
8Jun 6, 2026 23:422,48316,638,7305,100,0001,108,0002,117,632
9Jun 6, 2026 23:422,54915,506,4405,260,0001,113,0002,117,632