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:27Dominique GarmierDominique GarmierScore: 8,448Success
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:288,31747,473,01213,862,0006,931,0002,252,800
2Apr 21, 2026 08:288,35654,029,31314,922,0005,969,0002,506,752
3Apr 21, 2026 08:288,40342,528,29317,007,0004,001,0002,256,896
4Apr 21, 2026 08:288,40443,756,18816,009,0005,002,0002,256,896
5Apr 21, 2026 08:288,44841,456,58818,104,0003,017,0002,256,896
6Apr 21, 2026 08:288,50148,497,94616,193,0005,060,0002,510,848
7Apr 21, 2026 08:288,52739,110,47317,258,0004,060,0002,260,992
8Apr 21, 2026 08:288,58646,099,27918,401,0003,066,0002,252,800
9Apr 21, 2026 08:288,59447,455,96116,371,0005,116,0002,510,848