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 listApr 26, 2026 20:48TudyMTudyMScore: 463,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 20:48463,3081,175,161,5011,154,273,0003,997,0002,334,720
2Apr 26, 2026 20:48463,4481,173,994,9791,156,619,0002,001,0002,318,336
3Apr 26, 2026 20:48463,4601,181,574,5411,157,653,000999,0002,551,808
4Apr 26, 2026 20:48463,5861,179,806,2191,157,967,000999,0002,555,904
5Apr 26, 2026 20:48463,6601,179,103,6721,157,152,0001,998,0002,338,816
6Apr 26, 2026 20:48463,6641,179,241,0051,156,164,0002,997,0002,543,616
7Apr 26, 2026 20:48463,7021,182,172,5001,156,258,0002,998,0002,297,856
8Apr 26, 2026 20:48464,0431,175,448,8861,160,109,00002,301,952
9Apr 26, 2026 20:48464,0561,177,850,0681,157,143,0002,997,0002,318,336