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 7, 2026 22:26Josu San MartinJosu San MartinScore: 17,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 21:5816,854581,933,892553,171,0003,000,0002,289,664
2Jan 7, 2026 21:5817,202594,333,192564,653,0002,998,0002,338,816
3Jan 7, 2026 22:2617,590607,214,359577,470,0002,997,0002,347,008
4Jan 7, 2026 22:2617,729610,347,575582,045,0003,000,0002,351,104
5Jan 7, 2026 22:2617,983622,108,508591,453,0001,998,0002,347,008
6Jan 7, 2026 21:5818,056622,120,722593,865,0001,999,0002,289,664