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 7, 2026 21:12Josu San MartinJosu San MartinScore: 53,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 21:1252,7581,768,907,2911,590,109,000150,915,0002,306,048
2Jan 7, 2026 21:1253,2071,786,402,5031,605,918,000149,899,0002,289,664
3Jan 7, 2026 21:1253,3211,787,163,2051,614,704,000144,883,0002,285,568