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 13, 2026 08:12limanjun99limanjun99Score: 3,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 08:123,38028,563,8037,393,0001,056,0002,277,376
2Apr 13, 2026 08:123,39027,913,2596,356,0002,118,0002,510,848
3Apr 13, 2026 08:123,40029,686,5045,313,0003,188,0002,351,104
4Apr 13, 2026 08:123,40929,378,9045,327,0003,196,0002,441,216
5Apr 13, 2026 08:123,41824,550,2056,409,0002,136,0002,510,848
6Apr 13, 2026 08:123,43825,955,1614,297,0004,297,0002,506,752
7Apr 13, 2026 08:123,45629,187,0846,481,0002,160,0002,289,664
8Apr 13, 2026 08:123,48025,261,6865,438,0003,263,0002,510,848
9Apr 13, 2026 08:123,54828,739,3245,913,0002,956,0002,396,160