Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJun 23, 2025 03:32Ian MckibbenIan MckibbenScore: 15,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 03:3215,295528,503,536432,761,00071,960,0002,478,080
2Jun 23, 2025 03:3215,344526,695,622420,461,00085,889,0002,281,472
3Jun 23, 2025 03:3215,349524,784,159432,577,00073,927,0002,314,240
4Jun 23, 2025 03:3215,360528,735,449436,883,00069,981,0002,310,144
5Jun 23, 2025 03:3215,368537,268,434427,293,00079,867,0002,531,328
6Jun 23, 2025 03:3215,381528,536,692431,634,00075,935,0002,510,848
7Jun 23, 2025 03:3215,394539,571,922421,003,00087,000,0002,285,568
8Jun 23, 2025 03:3215,465531,878,515426,459,00083,893,0002,494,464
9Jun 23, 2025 03:3215,473531,731,065439,650,00070,943,0002,269,184