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 9, 2026 01:54Elijah KinElijah KinScore: 2,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 01:552,02414,230,6983,824,0001,237,0002,117,632
2Jun 9, 2026 01:552,02414,238,2393,821,0001,239,0002,117,632
3Jun 9, 2026 01:552,02614,232,5133,832,0001,233,0002,117,632
4Jun 9, 2026 01:552,04814,473,5883,878,0001,242,0002,117,632
5Jun 9, 2026 01:552,14514,473,2374,124,0001,240,0002,117,632
6Jun 9, 2026 01:552,18814,614,4934,219,0001,253,0002,117,632
7Jun 9, 2026 01:552,19414,532,1264,238,0001,247,0002,117,632
8Jun 9, 2026 01:552,19514,664,6394,236,0001,253,0002,117,632
9Jun 9, 2026 01:552,24214,830,9544,360,0001,245,0002,117,632