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 listJun 8, 2026 05:03Elijah KinElijah KinScore: 2,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 05:042,06414,250,4853,900,0001,262,0002,117,632
2Jun 8, 2026 05:042,07014,266,2543,940,0001,236,0002,117,632
3Jun 8, 2026 05:042,07414,219,7243,917,0001,268,0002,117,632
4Jun 8, 2026 05:042,23714,675,9044,344,0001,249,0002,117,632
5Jun 8, 2026 05:042,26114,774,1224,377,0001,277,0002,117,632
6Jun 8, 2026 05:042,32114,844,5614,542,0001,261,0002,117,632
7Jun 8, 2026 05:042,36214,988,9334,666,0001,241,0002,117,632
8Jun 8, 2026 05:042,37515,018,0354,683,0001,256,0002,117,632
9Jun 8, 2026 05:042,37817,791,9904,697,0001,250,0002,117,632