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 22, 2025 16:56Ian MckibbenIan MckibbenScore: 15,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 16:5615,391531,885,031426,909,00080,982,0002,527,232
2Jun 22, 2025 16:5615,393538,922,345435,983,00071,997,0002,437,120
3Jun 22, 2025 16:5615,394529,046,539441,006,00067,001,0002,318,336
4Jun 22, 2025 16:5615,403536,799,530431,397,00076,892,0002,420,736
5Jun 22, 2025 16:5615,403535,254,607424,423,00083,886,0002,506,752
6Jun 22, 2025 16:5615,459530,998,929429,275,00080,863,0002,318,336
7Jun 22, 2025 16:5615,488541,523,629435,084,00076,014,0002,531,328
8Jun 22, 2025 16:5615,495536,568,158441,433,00069,910,0002,306,048
9Jun 22, 2025 16:5615,687540,784,572436,709,00080,946,0002,310,144