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 1, 2026 15:55Josu San MartinJosu San MartinScore: 38,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 15:5538,2261,288,972,2191,097,671,000163,801,0002,383,872
2Jan 1, 2026 15:5538,6661,304,780,5161,131,206,000144,770,0002,375,680
3Jan 1, 2026 15:5539,0841,318,860,2061,141,016,000148,741,0002,445,312