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 20:10Josu San MartinJosu San MartinScore: 29,060Success
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 20:1027,589941,262,439908,439,0002,000,0002,306,048
2Jan 8, 2026 20:1028,629970,782,161942,767,0001,999,0002,289,664
3Jan 8, 2026 20:1028,860984,322,189948,380,0003,997,0002,289,664
4Jan 8, 2026 20:1029,060990,995,275956,994,0001,999,0002,289,664
5Jan 8, 2026 20:1029,116987,770,483957,814,0002,999,0002,289,664
6Jan 8, 2026 20:1029,131993,469,098959,340,0001,998,0002,351,104