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 29, 2025 19:35zielajzielajScore: 3,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 19:353,621149,025,267113,456,0006,024,0002,281,472
2Dec 29, 2025 19:353,629144,958,620111,770,0007,983,0002,289,664
3Dec 29, 2025 19:353,637148,536,904111,005,0009,000,0002,285,568
4Dec 29, 2025 19:353,646144,714,347112,304,0008,021,0002,285,568
5Dec 29, 2025 19:353,664142,260,152109,911,00010,991,0002,301,952
6Dec 29, 2025 19:353,667140,917,406113,001,0008,000,0002,383,872
7Dec 29, 2025 19:353,669148,890,418111,077,00010,007,0002,519,040
8Dec 29, 2025 19:353,698150,641,321113,033,0009,002,0002,383,872
9Dec 29, 2025 19:353,748142,775,081115,695,0007,978,0002,281,472