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 04:04Josu San MartinJosu San MartinScore: 15,928Success
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 04:0415,424534,287,633505,984,0002,999,0002,289,664
2Jan 8, 2026 04:0415,664546,844,738513,907,0002,999,0002,351,104
3Jan 8, 2026 04:0415,692549,840,623515,846,0001,999,0002,351,104
4Jan 8, 2026 04:0415,928550,612,097522,632,0002,997,0002,289,664
5Jan 8, 2026 04:0415,976555,951,369524,211,0003,001,0002,289,664
6Jan 8, 2026 04:0416,028554,624,487525,930,0002,999,0002,338,816