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:22Elijah KinElijah KinScore: 2,770Success
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:252,62817,429,8545,393,0001,179,0002,117,632
2Jun 4, 2026 02:252,66715,640,5125,477,0001,191,0002,117,632
3Jun 4, 2026 02:252,71416,312,7485,600,0001,186,0002,117,632
4Jun 4, 2026 02:252,76816,374,6045,802,0001,120,0002,117,632
5Jun 4, 2026 02:252,77016,396,7155,809,0001,117,0002,117,632
6Jun 4, 2026 02:252,80216,418,9795,803,0001,202,0002,117,632
7Jun 4, 2026 02:252,80416,492,5665,864,0001,147,0002,117,632
8Jun 4, 2026 02:252,85016,619,6015,956,0001,169,0002,117,632
9Jun 4, 2026 02:252,91216,695,9926,093,0001,187,0002,117,632