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 19, 2026 08:02Dominique GarmierDominique GarmierScore: 11,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 08:0211,43150,236,83123,474,0005,103,0002,281,472
2Mar 19, 2026 08:0211,43848,650,20324,510,0004,085,0002,269,184
3Mar 19, 2026 08:0211,44657,928,35322,483,0006,131,0002,400,256
4Mar 19, 2026 08:0211,45255,136,22625,564,0003,067,0002,347,008
5Mar 19, 2026 08:0211,53059,091,88325,844,0002,982,0002,269,184
6Mar 19, 2026 08:0211,55354,264,07622,907,0005,975,0002,289,664
7Mar 19, 2026 08:0211,59855,244,57225,996,0002,999,0002,363,392
8Mar 19, 2026 08:0211,65457,763,57023,108,0006,028,0002,490,368
9Mar 19, 2026 08:0211,69250,840,79125,199,0004,031,0002,338,816