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 listMar 25, 2026 02:29Dominique GarmierDominique GarmierScore: 42,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 02:2941,7171,398,639,0061,369,653,0006,998,0002,347,008
2Mar 25, 2026 02:2942,7911,443,156,9391,405,108,0006,995,0002,449,408
3Mar 25, 2026 02:2943,7011,470,545,2271,437,144,0004,997,0002,347,008