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 8, 2026 23:48Elijah KinElijah KinScore: 3,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 23:483,19017,103,7806,668,0001,307,0002,117,632
2Jun 8, 2026 23:483,23117,189,8766,771,0001,308,0002,117,632
3Jun 8, 2026 23:483,29217,388,1146,903,0001,328,0002,117,632
4Jun 8, 2026 23:483,32117,442,8776,998,0001,306,0002,117,632
5Jun 8, 2026 23:483,39217,669,2757,156,0001,324,0002,117,632
6Jun 8, 2026 23:483,40217,669,7677,185,0001,321,0002,117,632
7Jun 8, 2026 23:483,42318,215,2657,246,0001,312,0002,113,536
8Jun 8, 2026 23:483,44417,766,3937,288,0001,323,0002,117,632
9Jun 8, 2026 23:483,46218,065,1567,340,0001,316,0002,117,632