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 listDec 19, 2025 08:40Rajarshi BasuRajarshi BasuScore: 8,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 08:408,790315,775,690279,052,00011,002,0002,375,680
2Dec 19, 2025 08:408,953321,767,031290,468,0004,990,0002,347,008
3Dec 19, 2025 08:408,984324,622,015286,485,0009,982,0002,318,336