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 06:02Dominique GarmierDominique GarmierScore: 14,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:0114,49058,439,41030,188,0006,037,0002,428,928
2Mar 16, 2026 22:0114,49459,289,52832,209,0004,026,0002,437,120
3Mar 16, 2026 22:0114,50060,556,73533,229,0003,020,0002,441,216
4Mar 19, 2026 06:0214,50357,146,27931,222,0005,035,0002,469,888
5Mar 16, 2026 22:0114,50861,949,58531,234,0005,037,0002,506,752
6Mar 16, 2026 22:0114,51459,246,57034,270,0002,015,0002,392,064
7Mar 16, 2026 22:0114,51759,781,27532,261,0004,032,0002,289,664
8Mar 16, 2026 22:0114,52056,032,65532,267,0004,033,0002,433,024
9Mar 19, 2026 06:0214,55363,429,51231,330,0005,053,0002,424,832
10Mar 16, 2026 22:0114,57758,937,38433,406,0003,036,0002,424,832
11Mar 16, 2026 22:0114,70662,769,56733,785,0002,981,0002,441,216
12Mar 19, 2026 06:0214,74964,953,87031,891,0004,982,0002,428,928