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 23, 2026 03:56olliecrowolliecrowScore: 4,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 04:064,80228,780,9838,005,0004,002,0002,535,424
2Apr 23, 2026 04:064,80528,785,9499,011,0003,003,0002,543,616
3Apr 23, 2026 04:064,80829,103,3477,012,0005,008,0002,539,520
4Apr 23, 2026 04:064,82427,356,2539,046,0003,015,0002,519,040
5Apr 23, 2026 04:064,84429,145,7098,075,0004,037,0002,531,328
6Apr 23, 2026 04:064,86730,312,0678,112,0004,056,0002,535,424
7Apr 23, 2026 04:065,06528,892,3408,442,0004,221,0002,531,328
8Apr 23, 2026 04:065,06735,210,16610,558,0002,111,0002,555,904
9Apr 23, 2026 04:065,28035,691,77911,171,0002,031,0002,539,520