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 3, 2026 23:52Elijah KinElijah KinScore: 2,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 23:552,67415,718,0205,559,0001,128,0002,117,632
2Jun 3, 2026 23:552,68215,734,9135,564,0001,142,0002,117,632
3Jun 3, 2026 23:552,68815,885,5925,593,0001,127,0002,117,632
4Jun 3, 2026 23:552,69215,851,0625,606,0001,125,0002,117,632
5Jun 3, 2026 23:552,71016,202,1105,622,0001,153,0002,117,632
6Jun 3, 2026 23:552,71215,820,8665,676,0001,106,0002,117,632
7Jun 3, 2026 23:552,71515,944,8715,645,0001,143,0002,117,632
8Jun 3, 2026 23:552,76616,128,8435,728,0001,187,0002,117,632
9Jun 3, 2026 23:552,80916,503,6525,867,0001,157,0002,117,632