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 listDec 20, 2025 14:46Rajarshi BasuRajarshi BasuScore: 5,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 14:465,141191,360,040163,653,0005,987,0002,506,752
2Dec 20, 2025 14:455,146196,573,885164,824,0004,994,0002,523,136
3Dec 20, 2025 14:465,146192,427,126164,812,0004,994,0002,375,680
4Dec 20, 2025 14:465,163191,092,706165,358,0005,010,0002,514,944
5Dec 20, 2025 14:455,182202,807,745165,017,0006,000,0002,351,104
6Dec 20, 2025 14:455,185197,465,981165,096,0006,003,0002,416,640
7Dec 20, 2025 14:465,185198,994,095167,117,0004,002,0002,387,968
8Dec 20, 2025 14:465,191197,155,044166,305,0005,009,0002,347,008
9Dec 20, 2025 14:465,194202,225,593166,433,0004,983,0002,293,760