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:41Elijah KinElijah KinScore: 2,764Success
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:442,70815,838,4705,639,0001,131,0002,117,632
2Jun 4, 2026 02:442,74417,422,2355,717,0001,143,0002,117,632
3Jun 4, 2026 02:442,74816,368,2565,731,0001,141,0002,117,632
4Jun 4, 2026 02:442,76216,417,1315,759,0001,146,0002,117,632
5Jun 4, 2026 02:442,76416,265,0675,780,0001,131,0002,117,632
6Jun 4, 2026 02:442,82616,557,1125,909,0001,156,0002,117,632
7Jun 4, 2026 02:442,84216,518,5555,953,0001,152,0002,117,632
8Jun 4, 2026 02:442,85918,115,8955,958,0001,190,0002,117,632
9Jun 4, 2026 02:442,91218,723,5786,103,0001,178,0002,117,632