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 03:32Josu San MartinJosu San MartinScore: 28,956Success
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 03:4528,780978,889,699940,738,0008,997,0002,289,664
2Jan 8, 2026 03:4528,793983,441,338941,167,0008,992,0002,355,200
3Jan 8, 2026 03:3228,829980,797,457941,380,0009,993,0002,289,664
4Jan 8, 2026 03:4528,956986,528,749946,559,0008,995,0002,416,640
5Jan 8, 2026 03:3228,976983,793,713948,227,0007,993,0002,510,848
6Jan 8, 2026 03:3229,036998,900,383948,213,0009,991,0002,359,296