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:30Dominique GarmierDominique GarmierScore: 8,344Success
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:308,23849,379,05318,536,0002,059,0002,260,992
2Apr 21, 2026 08:308,27445,538,65216,550,0004,137,0002,252,800
3Apr 21, 2026 08:308,31044,744,11016,818,0003,957,0002,252,800
4Apr 21, 2026 08:308,34347,443,55516,885,0003,973,0002,355,200
5Apr 21, 2026 08:308,34450,480,62615,895,0004,967,0002,252,800
6Apr 21, 2026 08:308,35241,593,56216,904,0003,977,0002,510,848
7Apr 21, 2026 08:308,37141,152,62714,949,0005,979,0002,387,968
8Apr 21, 2026 08:308,39045,444,68115,981,0004,994,0002,256,896
9Apr 21, 2026 08:308,58642,619,24215,334,0006,133,0002,510,848