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 listJan 11, 2026 14:39Josu San MartinJosu San MartinScore: 7,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 14:387,785283,276,622249,911,0006,997,0002,297,856
2Jan 11, 2026 15:197,786285,818,830250,924,0005,998,0002,400,256
3Jan 11, 2026 15:197,794282,859,969250,184,0007,005,0002,383,872
4Jan 11, 2026 14:387,802283,869,224251,486,0005,987,0002,338,816
5Jan 11, 2026 14:397,804286,556,578251,529,0005,988,0002,314,240
6Jan 11, 2026 14:397,833282,499,694252,495,0005,988,0002,338,816
7Jan 11, 2026 15:197,841280,000,408252,770,0005,994,0002,314,240
8Jan 11, 2026 14:397,847281,137,981251,968,0006,999,0002,293,760
9Jan 11, 2026 14:387,849284,958,635250,031,0009,001,0002,396,160