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 listApr 21, 2026 08:28Dominique GarmierDominique GarmierScore: 8,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 08:288,31547,404,31515,839,0004,949,0002,510,848
2Apr 21, 2026 08:288,33847,476,58615,883,0004,963,0002,256,896
3Apr 21, 2026 08:288,34848,500,21216,896,0003,975,0002,256,896
4Apr 21, 2026 08:288,35350,571,60216,906,0003,977,0002,510,848
5Apr 21, 2026 08:288,35851,153,03918,907,0001,990,0002,256,896
6Apr 21, 2026 08:288,36153,274,20216,922,0003,981,0002,510,848
7Apr 21, 2026 08:288,36349,451,71818,918,0001,991,0002,502,656
8Apr 21, 2026 08:288,47046,318,24318,152,0003,025,0002,506,752
9Apr 21, 2026 08:288,65049,407,03316,477,0005,149,0002,502,656