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 28, 2026 08:52TudyMTudyMScore: 19,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:5419,44665,940,88142,539,0006,077,0002,428,928
2Apr 28, 2026 08:5419,47470,826,10942,726,0005,961,0002,428,928
3Apr 28, 2026 08:5419,50265,440,92043,780,0004,975,0002,355,200
4Apr 28, 2026 08:5419,61864,615,20142,041,0007,006,0002,355,200
5Apr 28, 2026 08:5419,64568,436,53744,103,0005,011,0002,355,200
6Apr 28, 2026 08:5419,65265,173,65345,121,0004,010,0002,363,392
7Apr 28, 2026 08:5419,71967,396,22544,369,0004,929,0002,367,488
8Apr 28, 2026 08:5419,94267,785,87145,869,0003,988,0002,355,200
9Apr 28, 2026 08:5419,98065,609,48143,957,0005,994,0002,367,488