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 listJun 25, 2025 00:19Ian MckibbenIan MckibbenScore: 572,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2025 00:19567,22318,760,532,91618,643,433,00074,941,0002,351,104
2Jun 25, 2025 00:19572,27618,928,170,83218,807,162,00077,930,0002,310,144
3Jun 25, 2025 00:19572,94518,946,252,28118,827,247,00079,928,0002,420,736