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 14:21Tomislav TunkovicTomislav TunkovicScore: 7,515Success
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 14:287,28026,503,02614,976,0003,225,0002,117,632
2Aug 14, 2026 14:287,32226,663,42615,075,0003,232,0002,117,632
3Aug 14, 2026 14:287,37326,604,65115,340,0003,093,0002,117,632
4Aug 14, 2026 14:287,49527,068,96715,513,0003,225,0002,117,632
5Aug 14, 2026 14:287,51527,151,88215,535,0003,253,0002,117,632
6Aug 14, 2026 14:287,58227,306,68315,696,0003,261,0002,117,632
7Aug 14, 2026 14:287,84127,949,83416,307,0003,296,0002,117,632
8Aug 14, 2026 14:287,88428,014,96516,487,0003,225,0002,117,632
9Aug 14, 2026 14:287,91628,212,37216,519,0003,273,0002,117,632