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 8, 2026 02:23Josu San MartinJosu San MartinScore: 14,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 02:1013,989491,478,435459,647,0001,998,0002,289,664
2Jan 8, 2026 02:1014,172497,862,689464,677,0002,997,0002,289,664
3Jan 8, 2026 02:5214,610506,939,278479,130,0003,000,0002,347,008
4Jan 8, 2026 02:5214,691515,383,985482,797,0001,999,0002,289,664
5Jan 8, 2026 02:1014,860522,011,306487,369,0002,996,0002,351,104
6Jan 8, 2026 02:2314,926517,213,428491,554,000999,0002,338,816
7Jan 8, 2026 02:5214,997523,500,209492,917,0001,999,0002,289,664
8Jan 8, 2026 02:2315,005523,139,764493,160,0002,000,0002,289,664
9Jan 8, 2026 02:2317,450605,698,559572,854,0002,999,0002,351,104