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 4, 2026 02:14Elijah KinElijah KinScore: 2,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 02:172,79016,505,6075,812,0001,164,0002,117,632
2Jun 4, 2026 02:172,81316,122,5135,869,0001,164,0002,117,632
3Jun 4, 2026 02:172,82316,077,3105,907,0001,151,0002,117,632
4Jun 4, 2026 02:172,83616,589,6555,923,0001,168,0002,117,632
5Jun 4, 2026 02:172,83616,507,0965,928,0001,163,0002,117,632
6Jun 4, 2026 02:172,84416,155,4245,943,0001,167,0002,117,632
7Jun 4, 2026 02:172,86416,117,4436,007,0001,154,0002,117,632
8Jun 4, 2026 02:172,87116,631,5436,056,0001,122,0002,117,632
9Jun 4, 2026 02:172,97516,983,0076,337,0001,101,0002,117,632