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 18, 2026 01:08Charles CabergsCharles CabergsScore: 22,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 01:0821,68778,280,83349,198,0005,020,0002,523,136
2Apr 18, 2026 01:0821,81482,520,64649,485,0005,049,0002,457,600
3Apr 18, 2026 01:0821,89082,628,41948,644,0006,080,0002,355,200
4Apr 18, 2026 01:0821,94984,898,54946,891,0007,981,0002,310,144
5Apr 18, 2026 01:0822,51684,610,00548,248,0008,041,0002,347,008
6Apr 18, 2026 01:0822,58584,211,70952,429,0004,033,0002,441,216
7Apr 18, 2026 01:0822,58880,648,36750,420,0006,050,0002,281,472
8Apr 18, 2026 01:0822,59083,476,25549,416,0007,059,0002,375,680
9Apr 18, 2026 01:0822,84583,468,20851,101,0006,011,0002,514,944