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 listOct 19, 2026 13:41highload-churnerhighload-churnerScore: 1,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 13:411,26812,406,3871,799,0001,371,000524,288
2Oct 19, 2026 13:411,34212,646,3852,281,0001,076,000524,288
3Oct 19, 2026 13:411,44712,799,2612,530,0001,088,000524,288
4Oct 19, 2026 13:411,50513,390,4122,692,0001,072,000524,288
5Oct 19, 2026 13:411,54713,089,0332,777,0001,091,000524,288
6Oct 19, 2026 13:411,55213,018,0892,779,0001,103,000524,288
7Oct 19, 2026 13:411,57213,427,2662,839,0001,093,000524,288
8Oct 19, 2026 13:411,57413,468,1162,832,0001,105,000524,288
9Oct 19, 2026 13:411,58213,109,7502,832,0001,125,000524,288