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 listMar 14, 2026 08:09KeefeKeefeScore: 3,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 08:093,76428,683,4694,182,0005,228,0002,322,432
2Mar 14, 2026 08:093,77931,516,0464,199,0005,249,0002,273,280
3Mar 14, 2026 08:093,79626,259,3795,272,0004,217,0002,510,848
4Mar 14, 2026 08:093,79725,910,8546,329,0003,164,0002,498,560
5Mar 14, 2026 08:093,80227,509,4385,280,0004,224,0002,486,272
6Mar 14, 2026 08:093,81728,789,4164,241,0005,301,0002,469,888
7Mar 14, 2026 08:093,84336,172,2535,338,0004,270,0002,473,984
8Mar 14, 2026 08:094,10424,874,9817,182,0003,078,0002,318,336
9Mar 14, 2026 08:094,15128,681,6326,227,0004,151,0002,314,240