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 listMay 21, 2026 18:52Jacob McDanielJacob McDanielScore: 2,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:522,44416,249,6124,912,0001,200,0002,117,632
2May 21, 2026 18:522,44917,875,5804,923,0001,200,0002,117,632
3May 21, 2026 18:522,51417,369,3255,051,0001,236,0002,117,632
4May 21, 2026 18:522,52017,358,5355,055,0001,245,0002,117,632
5May 21, 2026 18:522,54316,469,9595,108,0001,251,0002,117,632
6May 21, 2026 18:522,58817,012,4315,193,0001,277,0002,117,632
7May 21, 2026 18:522,59418,678,8575,203,0001,284,0002,117,632
8May 21, 2026 18:522,62819,748,9915,243,0001,329,0002,117,632
9May 21, 2026 18:522,64816,871,3435,328,0001,294,0002,117,632