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 07:33Elijah KinElijah KinScore: 5,276Success
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 07:374,90421,229,49410,023,0002,237,0002,117,632
2Jun 3, 2026 07:374,91621,260,7269,162,0003,128,0002,117,632
3Jun 3, 2026 07:375,21422,013,0079,958,0003,078,0002,113,536
4Jun 3, 2026 07:375,23822,127,26410,876,0002,221,0002,113,536
5Jun 3, 2026 07:375,27622,586,12510,975,0002,217,0002,113,536
6Jun 3, 2026 07:375,27922,347,34510,985,0002,213,0002,113,536
7Jun 3, 2026 07:375,50424,871,59110,609,0003,153,0002,113,536
8Jun 3, 2026 07:375,53623,319,80210,607,0003,234,0002,113,536
9Jun 3, 2026 07:375,54823,247,05510,703,0003,168,0002,113,536