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 1, 2026 14:52Victor MerckléVictor MerckléScore: 2,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 14:532,52213,896,4194,981,0001,326,0002,113,536
2Jun 1, 2026 14:532,52315,874,8044,982,0001,326,0002,113,536
3Jun 1, 2026 14:532,52413,894,1014,987,0001,324,0002,113,536
4Jun 1, 2026 14:532,53413,903,2425,009,0001,327,0002,113,536
5Jun 1, 2026 14:532,53513,886,3374,985,0001,354,0002,113,536
6Jun 1, 2026 14:532,54114,134,3475,025,0001,328,0002,113,536
7Jun 1, 2026 14:532,54213,927,6185,028,0001,329,0002,113,536
8Jun 1, 2026 14:532,57413,952,1365,107,0001,328,0002,113,536
9Jun 1, 2026 14:532,62214,036,8295,230,0001,326,0002,113,536