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 listAug 13, 2026 19:55Tomislav TunkovicTomislav TunkovicScore: 5,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 19:595,894202,983,370190,210,0004,308,0002,121,728stderr
2Aug 13, 2026 19:595,895203,023,577190,073,0004,484,0002,121,728stderr
3Aug 13, 2026 19:595,899203,004,660190,299,0004,394,0002,121,728stderr
4Aug 13, 2026 19:595,906203,373,639190,621,0004,291,0002,121,728stderr
5Aug 13, 2026 19:595,909203,332,930190,612,0004,399,0002,121,728stderr
6Aug 13, 2026 19:595,910203,285,927190,674,0004,370,0002,121,728stderr
7Aug 13, 2026 19:595,922203,716,423191,253,0004,198,0002,121,728stderr
8Aug 13, 2026 19:595,924203,999,146191,246,0004,256,0002,121,728stderr
9Aug 13, 2026 19:596,117210,204,052197,627,0004,235,0002,121,728stderr