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 20, 2025 10:16Rajarshi BasuRajarshi BasuScore: 5,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 10:165,193199,349,163165,366,0006,013,0002,375,680
2Dec 20, 2025 10:165,216195,468,996167,120,0005,003,0002,281,472
3Dec 20, 2025 10:165,221198,762,089165,286,0007,012,0002,523,136
4Dec 20, 2025 10:165,222199,839,947168,328,0004,007,0002,310,144
5Dec 20, 2025 10:165,232197,110,547167,651,0004,989,0002,510,848
6Dec 20, 2025 10:165,251196,073,270167,268,0006,009,0002,281,472