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:29Dominique GarmierDominique GarmierScore: 8,425Success
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:298,33345,633,24618,849,0001,984,0002,494,464
2Apr 21, 2026 08:298,35648,530,87914,923,0005,969,0002,342,912
3Apr 21, 2026 08:298,35948,438,33617,913,0002,985,0002,506,752
4Apr 21, 2026 08:298,42048,573,77116,039,0005,012,0002,252,800
5Apr 21, 2026 08:298,42536,953,15015,046,0006,018,0002,256,896
6Apr 21, 2026 08:298,45334,576,37519,122,0002,012,0002,277,376
7Apr 21, 2026 08:298,53447,514,63116,257,0005,080,0002,256,896
8Apr 21, 2026 08:298,59049,463,38018,409,0003,068,0002,252,800
9Apr 21, 2026 08:298,60848,811,24813,322,0008,198,0002,252,800