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 14, 2026 16:43Tomislav TunkovicTomislav TunkovicScore: 4,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 16:444,16518,862,7499,274,0001,139,0002,121,728
2Aug 14, 2026 16:444,17618,814,3279,277,0001,164,0002,121,728
3Aug 14, 2026 16:444,37219,302,3299,762,0001,169,0002,121,728
4Aug 14, 2026 16:444,49319,614,43510,066,0001,168,0002,121,728
5Aug 14, 2026 16:444,54219,856,81810,186,0001,169,0002,121,728
6Aug 14, 2026 16:444,55019,765,71110,215,0001,162,0002,121,728
7Aug 14, 2026 16:444,57919,725,10710,266,0001,182,0002,121,728
8Aug 14, 2026 16:444,59619,680,23410,328,0001,164,0002,121,728
9Aug 14, 2026 16:444,60319,843,81710,361,0001,148,0002,121,728