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 01:45Josu San MartinJosu San MartinScore: 4,702Success
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 01:454,694179,850,066152,914,0001,998,0002,289,664
2Jan 11, 2026 01:454,694176,396,533152,905,0001,998,0002,289,664
3Jan 11, 2026 01:454,694179,007,522153,907,000999,0002,289,664
4Jan 11, 2026 01:454,702180,225,900154,151,0001,000,0002,289,664
5Jan 11, 2026 01:454,702181,665,287154,181,0001,001,0002,289,664
6Jan 11, 2026 01:454,702176,552,235153,159,0002,002,0002,396,160