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 16, 2026 10:52Dominique GarmierDominique GarmierScore: 15,450Success
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 10:5215,41863,183,36131,446,0007,100,0002,273,280
2Mar 16, 2026 10:5215,42761,096,41534,508,0004,059,0002,293,760
3Mar 16, 2026 10:5215,44759,755,76733,537,0005,081,0002,433,024
4Mar 16, 2026 10:5215,45069,420,29936,592,0002,032,0002,441,216
5Mar 16, 2026 10:5215,45064,913,41934,560,0004,065,0002,285,568
6Mar 16, 2026 10:5215,45465,876,24433,551,0005,083,0002,285,568
7Mar 16, 2026 10:5215,45661,744,22732,539,0006,101,0002,490,368
8Mar 16, 2026 10:5215,46868,068,81534,600,0004,070,0002,428,928
9Mar 16, 2026 10:5215,49866,886,77835,686,0003,058,0002,437,120