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 20:48Elijah KinElijah KinScore: 2,341Success
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 20:492,05414,191,8813,902,0001,233,0002,117,632
2Jun 8, 2026 20:492,07514,316,5543,932,0001,257,0002,117,632
3Jun 8, 2026 20:492,08014,213,1363,939,0001,263,0002,117,632
4Jun 8, 2026 20:492,24014,657,4904,351,0001,249,0002,117,632
5Jun 8, 2026 20:492,34114,902,8664,595,0001,259,0002,117,632
6Jun 8, 2026 20:492,39315,220,7454,742,0001,242,0002,117,632
7Jun 8, 2026 20:492,40415,104,1964,755,0001,256,0002,117,632
8Jun 8, 2026 20:492,41215,195,8794,919,0001,113,0002,117,632
9Jun 8, 2026 20:492,46915,222,7874,815,0001,359,0002,117,632