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 21, 2026 20:42Yuriy LyfenkoYuriy LyfenkoScore: 3,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 20:533,77625,034,7449,441,00002,494,464
2Mar 21, 2026 20:533,78825,008,0938,418,0001,052,0002,273,280
3Mar 21, 2026 20:423,79326,914,6519,483,00002,490,368
4Mar 21, 2026 20:413,79525,242,7519,488,00002,334,720
5Mar 21, 2026 20:533,79624,581,4858,435,0001,054,0002,510,848
6Mar 21, 2026 20:413,79725,577,5988,439,0001,054,0002,510,848
7Mar 21, 2026 20:533,79826,018,9218,441,0001,055,0002,334,720
8Mar 21, 2026 20:533,84225,983,9998,538,0001,067,0002,486,272
9Mar 21, 2026 20:533,87524,686,8918,612,0001,076,0002,490,368
10Mar 21, 2026 20:533,91329,048,2499,782,00002,473,984
11Mar 21, 2026 20:423,91631,597,7558,702,0001,087,0002,510,848
12Mar 21, 2026 20:423,92027,800,2998,711,0001,088,0002,490,368
13Mar 21, 2026 20:533,96326,594,9099,908,00002,510,848
14Mar 21, 2026 20:414,01127,089,4198,022,0002,005,0002,486,272
15Mar 21, 2026 20:534,02834,683,6609,063,0001,007,0002,506,752