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 04:26Rajarshi BasuRajarshi BasuScore: 5,761Success
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 04:265,707211,364,498184,340,0004,007,0002,523,136
2Dec 20, 2025 04:265,712216,012,218184,483,0004,010,0002,351,104
3Dec 20, 2025 04:265,722215,615,693182,841,0005,994,0002,519,040
4Dec 20, 2025 04:265,758214,492,649183,002,0007,000,0002,514,944
5Dec 20, 2025 04:265,761215,181,225186,121,0004,002,0002,408,448
6Dec 20, 2025 04:265,798218,875,760187,336,0004,007,0002,449,408
7Dec 20, 2025 04:265,977224,124,196193,231,0004,004,0002,514,944
8Dec 20, 2025 04:265,982224,119,389191,437,0005,982,0002,510,848
9Dec 20, 2025 04:265,992226,166,936192,751,0004,993,0002,469,888